TSTP Solution File: LCL094-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL094-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:53 EDT 2022
% Result : Unsatisfiable 1.46s 1.64s
% Output : Refutation 1.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL094-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 14:56:37 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.20/0.36 Sun Jul 3 14:56:37 2022
% 0.20/0.36 The command was "./sos". The process ID is 20129.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 3
% 0.20/0.38 percentage of clauses intially in UL: 66
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 4
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 1
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 1.46/1.64
% 1.46/1.64 -------- PROOF --------
% 1.46/1.64 % SZS status Unsatisfiable
% 1.46/1.64 % SZS output start Refutation
% 1.46/1.64
% 1.46/1.64 Model 2 (0.00 seconds, 0 Inserts)
% 1.46/1.64
% 1.46/1.64 Stopped by limit on number of solutions
% 1.46/1.64
% 1.46/1.64 Model 3 (0.00 seconds, 0 Inserts)
% 1.46/1.64
% 1.46/1.64 Stopped by limit on number of solutions
% 1.46/1.64
% 1.46/1.64 Model 4 (0.00 seconds, 0 Inserts)
% 1.46/1.64
% 1.46/1.64 Stopped by limit on number of solutions
% 1.46/1.64
% 1.46/1.64 Model 5 [ 5 0 201 ] (0.00 seconds, 17777 Inserts)
% 1.46/1.64
% 1.46/1.64 ----> UNIT CONFLICT at 1.25 sec ----> 784 [binary,783.1,2.1] {+} $F.
% 1.46/1.64
% 1.46/1.64 Length of proof is 23. Level of proof is 16.
% 1.46/1.64
% 1.46/1.64 ---------------- PROOF ----------------
% 1.46/1.64 % SZS status Unsatisfiable
% 1.46/1.64 % SZS output start Refutation
% 1.46/1.64
% 1.46/1.64 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.46/1.64 2 [] {+} -is_a_theorem(implies(a,implies(implies(a,b),b))).
% 1.46/1.64 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 1.46/1.64 4 [hyper,3,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))).
% 1.46/1.64 5 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 1.46/1.64 7 [hyper,5,1,5] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 1.46/1.64 9 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,C))))).
% 1.46/1.64 10 [hyper,7,1,7] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 1.46/1.64 12 [hyper,10,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))).
% 1.46/1.64 20 [hyper,9,1,9] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))).
% 1.46/1.64 21 [hyper,9,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),E),implies(B,E)))).
% 1.46/1.64 23 [hyper,20,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(implies(implies(D,E),C),D)))).
% 1.46/1.64 32 [hyper,12,1,12] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))).
% 1.46/1.64 37 [hyper,32,1,5] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 1.46/1.64 44 [hyper,37,1,37] {+} is_a_theorem(implies(A,implies(B,A))).
% 1.46/1.64 49 [hyper,44,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 1.46/1.64 88 [hyper,49,1,49] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 1.46/1.64 93 [hyper,88,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(B,C)),implies(D,implies(B,C))))).
% 1.46/1.64 136 [hyper,21,1,21] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(A,D))).
% 1.46/1.64 216 [hyper,23,1,23] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(C,D),B),C))).
% 1.46/1.64 449 [hyper,216,1,88] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 1.46/1.64 481 [hyper,449,1,449] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 1.46/1.64 636 [hyper,93,1,481] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))).
% 1.46/1.64 649 [hyper,636,1,136] {-} is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))).
% 1.46/1.64 680 [hyper,649,1,636] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))).
% 1.46/1.64 783 [hyper,680,1,680] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 1.46/1.64 784 [binary,783.1,2.1] {+} $F.
% 1.46/1.64
% 1.46/1.64 % SZS output end Refutation
% 1.46/1.64 ------------ end of proof -------------
% 1.46/1.64
% 1.46/1.64
% 1.46/1.64 Search stopped by max_proofs option.
% 1.46/1.64
% 1.46/1.64
% 1.46/1.64 Search stopped by max_proofs option.
% 1.46/1.64
% 1.46/1.64 ============ end of search ============
% 1.46/1.64
% 1.46/1.64 ----------- soft-scott stats ----------
% 1.46/1.64
% 1.46/1.64 true clauses given 8 (10.1%)
% 1.46/1.64 false clauses given 71
% 1.46/1.64
% 1.46/1.64 FALSE TRUE
% 1.46/1.64 8 0 1
% 1.46/1.64 12 6 2
% 1.46/1.64 14 27 2
% 1.46/1.64 16 79 3
% 1.46/1.64 18 114 3
% 1.46/1.64 20 121 1
% 1.46/1.64 22 90 0
% 1.46/1.64 24 64 0
% 1.46/1.64 26 30 0
% 1.46/1.64 28 25 0
% 1.46/1.64 30 23 0
% 1.46/1.64 32 28 0
% 1.46/1.64 34 25 0
% 1.46/1.64 36 20 0
% 1.46/1.64 38 10 0
% 1.46/1.64 40 4 0
% 1.46/1.64 tot: 666 12 (1.8% true)
% 1.46/1.64
% 1.46/1.64
% 1.46/1.64 Model 5 [ 5 0 201 ] (0.00 seconds, 17777 Inserts)
% 1.46/1.64
% 1.46/1.64 That finishes the proof of the theorem.
% 1.46/1.64
% 1.46/1.64 Process 20129 finished Sun Jul 3 14:56:38 2022
%------------------------------------------------------------------------------