TSTP Solution File: LCL066-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:41 EDT 2022
% Result : Unsatisfiable 8.44s 8.67s
% Output : Refutation 8.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 13:48:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n004.cluster.edu,
% 0.14/0.37 Sat Jul 2 13:48:23 2022
% 0.14/0.37 The command was "./sos". The process ID is 21448.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set without equality. The strategy will
% 0.14/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.37 in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 2
% 0.14/0.40 number of clauses initially in problem: 5
% 0.14/0.40 percentage of clauses intially in UL: 40
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 5
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 2
% 0.14/0.40 distinct constant count: 2
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 8.44/8.67
% 8.44/8.67 -------- PROOF --------
% 8.44/8.67 % SZS status Unsatisfiable
% 8.44/8.67 % SZS output start Refutation
% 8.44/8.67
% 8.44/8.67 Model 3 (0.00 seconds, 0 Inserts)
% 8.44/8.67
% 8.44/8.67 Stopped by limit on number of solutions
% 8.44/8.67
% 8.44/8.67 Stopped by limit on insertions
% 8.44/8.67
% 8.44/8.67 Model 4 [ 1 1 468 ] (0.00 seconds, 250000 Inserts)
% 8.44/8.67
% 8.44/8.67 Model 5 (0.00 seconds, 250000 Inserts)
% 8.44/8.67
% 8.44/8.67 Stopped by limit on number of solutions
% 8.44/8.67
% 8.44/8.67 Stopped by limit on insertions
% 8.44/8.67
% 8.44/8.67 Model 6 [ 1 0 170 ] (0.00 seconds, 250000 Inserts)
% 8.44/8.67
% 8.44/8.67 Model 7 [ 1 0 236 ] (0.00 seconds, 213395 Inserts)
% 8.44/8.67
% 8.44/8.67 Model 8 [ 1 1 34 ] (0.00 seconds, 207067 Inserts)
% 8.44/8.67
% 8.44/8.67 Model 9 [ 1 211 223742 ] (0.00 seconds, 228406 Inserts)
% 8.44/8.67
% 8.44/8.67 ----> UNIT CONFLICT at 8.27 sec ----> 288 [binary,287.1,2.1] {-} $F.
% 8.44/8.67
% 8.44/8.67 Length of proof is 14. Level of proof is 7.
% 8.44/8.67
% 8.44/8.67 ---------------- PROOF ----------------
% 8.44/8.67 % SZS status Unsatisfiable
% 8.44/8.67 % SZS output start Refutation
% 8.44/8.67
% 8.44/8.67 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 8.44/8.67 2 [] {+} -is_a_theorem(implies(a,implies(not(a),b))).
% 8.44/8.67 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 8.44/8.67 4 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 8.44/8.67 5 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 8.44/8.67 7 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 8.44/8.67 9 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 8.44/8.67 11 [hyper,4,1,7] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 8.44/8.67 13 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 8.44/8.67 16 [hyper,13,1,7] {+} is_a_theorem(implies(A,A)).
% 8.44/8.67 24 [hyper,11,1,3] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 8.44/8.67 26 [hyper,16,1,3] {+} is_a_theorem(implies(A,implies(B,B))).
% 8.44/8.67 27 [hyper,24,1,11] {+} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 8.44/8.67 29 [hyper,24,1,3] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 8.44/8.67 45 [hyper,26,1,9] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 8.44/8.67 76 [hyper,29,1,4] {-} is_a_theorem(implies(implies(A,not(B)),implies(A,implies(B,C)))).
% 8.44/8.67 279 [hyper,45,1,27] {+} is_a_theorem(implies(not(not(A)),A)).
% 8.44/8.67 283 [hyper,279,1,5] {+} is_a_theorem(implies(A,not(not(A)))).
% 8.44/8.67 287 [hyper,283,1,76] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 8.44/8.67 288 [binary,287.1,2.1] {-} $F.
% 8.44/8.67
% 8.44/8.67 % SZS output end Refutation
% 8.44/8.67 ------------ end of proof -------------
% 8.44/8.67
% 8.44/8.67
% 8.44/8.67 Search stopped by max_proofs option.
% 8.44/8.67
% 8.44/8.67
% 8.44/8.67 Search stopped by max_proofs option.
% 8.44/8.67
% 8.44/8.67 ============ end of search ============
% 8.44/8.67
% 8.44/8.67 ----------- soft-scott stats ----------
% 8.44/8.67
% 8.44/8.67 true clauses given 11 (20.0%)
% 8.44/8.67 false clauses given 44
% 8.44/8.67
% 8.44/8.67 FALSE TRUE
% 8.44/8.67 6 0 1
% 8.44/8.67 7 0 1
% 8.44/8.67 8 0 2
% 8.44/8.67 10 0 8
% 8.44/8.67 11 6 3
% 8.44/8.67 12 12 20
% 8.44/8.67 13 23 8
% 8.44/8.67 14 10 14
% 8.44/8.67 15 15 2
% 8.44/8.67 16 8 7
% 8.44/8.67 17 5 1
% 8.44/8.67 18 13 6
% 8.44/8.67 19 4 0
% 8.44/8.67 20 9 5
% 8.44/8.67 22 1 2
% 8.44/8.67 23 2 1
% 8.44/8.67 24 6 5
% 8.44/8.67 26 5 1
% 8.44/8.67 30 1 0
% 8.44/8.67 32 2 2
% 8.44/8.67 34 0 3
% 8.44/8.67 36 1 0
% 8.44/8.67 46 0 1
% 8.44/8.67 50 0 1
% 8.44/8.67 tot: 123 94 (43.3% true)
% 8.44/8.67
% 8.44/8.67
% 8.44/8.67 Model 9 [ 1 211 223742 ] (0.00 seconds, 228406 Inserts)
% 8.44/8.67
% 8.44/8.67 That finishes the proof of the theorem.
% 8.44/8.67
% 8.44/8.67 Process 21448 finished Sat Jul 2 13:48:31 2022
%------------------------------------------------------------------------------