TSTP Solution File: LCL638+1.001 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:31:12 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 09:53:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n015.cluster.edu,
% 0.12/0.36 Sun Jul 3 09:53:15 2022
% 0.12/0.36 The command was "./sos". The process ID is 6009.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 43
% 0.19/0.41 number of clauses initially in problem: 44
% 0.19/0.41 percentage of clauses intially in UL: 97
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 10
% 0.19/0.41 distinct predicate count: 2
% 0.19/0.41 distinct function count: 6
% 0.19/0.41 distinct constant count: 2
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 56 [binary,55.1,12.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 7. Level of proof is 7.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {+} -r1($c2,A)| -r1(A,B)|r1(B,$f1(A,B))|p1(A).
% 0.19/0.41 2 [] {+} -r1($c2,A)| -r1(A,B)| -p1($f1(A,B))|p1(A).
% 0.19/0.41 9 [] {+} -r1($c2,A)| -r1(A,B)| -r1(B,C)|p1(C)|r1(A,$f5(A)).
% 0.19/0.41 10 [] {+} -r1($c2,A)| -r1(A,B)| -r1(B,C)|p1(C)| -p1($f5(A)).
% 0.19/0.41 11 [] {+} -r1($c2,A)|r1(A,$f6(A)).
% 0.19/0.41 12 [] {+} -p1($c1).
% 0.19/0.41 13 [] {+} -r1($c1,A)|p1(A).
% 0.19/0.41 44 [] {-} r1($c2,$c1).
% 0.19/0.41 45 [hyper,44,11] {+} r1($c1,$f6($c1)).
% 0.19/0.41 47 [hyper,45,1,44,unit_del,12] {+} r1($f6($c1),$f1($c1,$f6($c1))).
% 0.19/0.41 48 [hyper,47,9,44,45] {+} p1($f1($c1,$f6($c1)))|r1($c1,$f5($c1)).
% 0.19/0.41 51 [hyper,48,2,44,45,unit_del,12] {+} r1($c1,$f5($c1)).
% 0.19/0.41 52 [hyper,51,13] {+} p1($f5($c1)).
% 0.19/0.41 54 [hyper,52,10,44,45,47] {+} p1($f1($c1,$f6($c1))).
% 0.19/0.41 55 [hyper,54,2,44,45] {-} p1($c1).
% 0.19/0.41 56 [binary,55.1,12.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 8 (88.9%)
% 0.19/0.41 false clauses given 1
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 7 0 1
% 0.19/0.41 17 0 1
% 0.19/0.41 tot: 0 2 (100.0% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 6009 finished Sun Jul 3 09:53:15 2022
%------------------------------------------------------------------------------