TSTP Solution File: LCL025-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL025-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:27:26 EDT 2022
% Result : Unsatisfiable 20.08s 20.34s
% Output : Refutation 20.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL025-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 16:58:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n006.cluster.edu,
% 0.13/0.36 Sat Jul 2 16:58:52 2022
% 0.13/0.36 The command was "./sos". The process ID is 10231.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 2
% 0.20/0.40 number of clauses initially in problem: 5
% 0.20/0.40 percentage of clauses intially in UL: 40
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 6
% 0.20/0.40 distinct predicate count: 1
% 0.20/0.40 distinct function count: 1
% 0.20/0.40 distinct constant count: 4
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 20.08/20.34
% 20.08/20.34 -- HEY sandbox, WE HAVE A PROOF!! --
% 20.08/20.34
% 20.08/20.34 Model 3 (0.00 seconds, 0 Inserts)
% 20.08/20.34
% 20.08/20.34 Stopped by limit on number of solutions
% 20.08/20.34
% 20.08/20.34 Model 4 (0.00 seconds, 0 Inserts)
% 20.08/20.34
% 20.08/20.34 Stopped by limit on number of solutions
% 20.08/20.34
% 20.08/20.34 Model 5 [ 1 368 196181 ] (0.00 seconds, 201689 Inserts)
% 20.08/20.34
% 20.08/20.34 Model 6 [ 2 394 189155 ] (0.00 seconds, 191596 Inserts)
% 20.08/20.34
% 20.08/20.34 Model 7 [ 2 1 2294 ] (0.00 seconds, 191574 Inserts)
% 20.08/20.34
% 20.08/20.34 Model 8 [ 3 393 189499 ] (0.00 seconds, 191895 Inserts)
% 20.08/20.34
% 20.08/20.34 Model 9 [ 4 399 187661 ] (0.00 seconds, 192056 Inserts)
% 20.08/20.34
% 20.08/20.34 ----> UNIT CONFLICT at 19.95 sec ----> 3062 [binary,3061.1,2.1] {-} $F.
% 20.08/20.34
% 20.08/20.34 Length of proof is 11. Level of proof is 7.
% 20.08/20.34
% 20.08/20.34 ---------------- PROOF ----------------
% 20.08/20.34 % SZS status Unsatisfiable
% 20.08/20.34 % SZS output start Refutation
% 20.08/20.34
% 20.08/20.34 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 20.08/20.34 2 [] {+} -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 20.08/20.34 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 20.08/20.34 5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 20.08/20.34 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 20.08/20.34 12 [hyper,5,1,5] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 20.08/20.34 13 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))).
% 20.08/20.34 45 [hyper,12,1,6] {-} is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))).
% 20.08/20.34 52 [hyper,45,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(implies(C,B),D)),implies(B,D)))).
% 20.08/20.34 59 [hyper,13,1,45] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 20.08/20.34 60 [hyper,13,1,12] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(implies(A,B),implies(A,C)),D)),implies(implies(A,implies(B,C)),D))).
% 20.08/20.34 1064 [hyper,52,1,45] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 20.08/20.34 1081 [hyper,1064,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))).
% 20.08/20.34 2474 [hyper,1081,1,60] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 20.08/20.34 3061 [hyper,2474,1,59] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 20.08/20.34 3062 [binary,3061.1,2.1] {-} $F.
% 20.08/20.34
% 20.08/20.34 % SZS output end Refutation
% 20.08/20.34 ------------ end of proof -------------
% 20.08/20.34
% 20.08/20.34
% 20.08/20.34 Search stopped by max_proofs option.
% 20.08/20.34
% 20.08/20.34
% 20.08/20.34 Search stopped by max_proofs option.
% 20.08/20.34
% 20.08/20.34 ============ end of search ============
% 20.08/20.34
% 20.08/20.34 ----------- soft-scott stats ----------
% 20.08/20.34
% 20.08/20.34 true clauses given 31 (16.9%)
% 20.08/20.34 false clauses given 152
% 20.08/20.34
% 20.08/20.34 FALSE TRUE
% 20.08/20.34 12 0 57
% 20.08/20.34 14 167 155
% 20.08/20.34 16 375 261
% 20.08/20.34 18 430 221
% 20.08/20.34 20 274 115
% 20.08/20.34 22 124 92
% 20.08/20.34 24 58 58
% 20.08/20.34 26 52 48
% 20.08/20.34 28 46 30
% 20.08/20.34 30 17 19
% 20.08/20.34 32 16 23
% 20.08/20.34 34 12 18
% 20.08/20.34 36 8 15
% 20.08/20.34 38 7 6
% 20.08/20.34 40 1 3
% 20.08/20.34 42 0 3
% 20.08/20.34 44 1 3
% 20.08/20.34 46 2 2
% 20.08/20.34 48 0 3
% 20.08/20.34 50 1 2
% 20.08/20.34 tot: 1591 1134 (41.6% true)
% 20.08/20.34
% 20.08/20.34
% 20.08/20.34 Model 9 [ 4 399 187661 ] (0.00 seconds, 192056 Inserts)
% 20.08/20.34
% 20.08/20.34 That finishes the proof of the theorem.
% 20.08/20.34
% 20.08/20.34 Process 10231 finished Sat Jul 2 16:59:12 2022
%------------------------------------------------------------------------------