TSTP Solution File: LCL069-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:42 EDT 2022
% Result : Unsatisfiable 6.14s 6.39s
% Output : Refutation 6.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n012.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 23:34:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n012.cluster.edu,
% 0.13/0.35 Sat Jul 2 23:34:32 2022
% 0.13/0.35 The command was "./sos". The process ID is 32192.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 5
% 0.13/0.38 percentage of clauses intially in UL: 40
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 5
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 2
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 6.14/6.39
% 6.14/6.39 -------- PROOF --------
% 6.14/6.39 % SZS status Unsatisfiable
% 6.14/6.39 % SZS output start Refutation
% 6.14/6.39
% 6.14/6.39 Model 2 (0.00 seconds, 0 Inserts)
% 6.14/6.39
% 6.14/6.39 Stopped by limit on number of solutions
% 6.14/6.39
% 6.14/6.39 Model 3 (0.00 seconds, 0 Inserts)
% 6.14/6.39
% 6.14/6.39 Stopped by limit on number of solutions
% 6.14/6.39
% 6.14/6.39 Stopped by limit on insertions
% 6.14/6.39
% 6.14/6.39 Model 4 [ 1 1 468 ] (0.00 seconds, 250000 Inserts)
% 6.14/6.39
% 6.14/6.39 Stopped by limit on insertions
% 6.14/6.39
% 6.14/6.39 Model 5 [ 1 0 296 ] (0.00 seconds, 250000 Inserts)
% 6.14/6.39
% 6.14/6.39 Stopped by limit on insertions
% 6.14/6.39
% 6.14/6.39 Model 6 [ 1 0 86 ] (0.00 seconds, 250000 Inserts)
% 6.14/6.39
% 6.14/6.39 Model 7 [ 1 1 33 ] (0.00 seconds, 212944 Inserts)
% 6.14/6.39
% 6.14/6.39 Stopped by limit on insertions
% 6.14/6.39
% 6.14/6.39 Model 8 [ 1 1 196 ] (0.00 seconds, 250000 Inserts)
% 6.14/6.39
% 6.14/6.39 ----> UNIT CONFLICT at 6.00 sec ----> 410 [binary,409.1,2.1] {-} $F.
% 6.14/6.39
% 6.14/6.39 Length of proof is 10. Level of proof is 8.
% 6.14/6.39
% 6.14/6.39 ---------------- PROOF ----------------
% 6.14/6.39 % SZS status Unsatisfiable
% 6.14/6.39 % SZS output start Refutation
% 6.14/6.39
% 6.14/6.39 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 6.14/6.39 2 [] {+} -is_a_theorem(implies(a,implies(not(a),b))).
% 6.14/6.39 3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 6.14/6.39 4 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 6.14/6.39 5 [] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))).
% 6.14/6.39 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,A))).
% 6.14/6.39 12 [hyper,4,1,6] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 6.14/6.39 18 [hyper,5,1,12] {-} is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))).
% 6.14/6.39 82 [hyper,18,1,6] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))).
% 6.14/6.39 96 [hyper,82,1,12] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 6.14/6.39 97 [hyper,82,1,6] {+} is_a_theorem(implies(A,implies(B,B))).
% 6.14/6.39 99 [hyper,97,1,97] {+} is_a_theorem(implies(A,A)).
% 6.14/6.39 103 [hyper,96,1,96] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 6.14/6.39 118 [hyper,103,1,18] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 6.14/6.39 409 [hyper,118,1,99] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 6.14/6.39 410 [binary,409.1,2.1] {-} $F.
% 6.14/6.39
% 6.14/6.39 % SZS output end Refutation
% 6.14/6.39 ------------ end of proof -------------
% 6.14/6.39
% 6.14/6.39
% 6.14/6.39 Search stopped by max_proofs option.
% 6.14/6.39
% 6.14/6.39
% 6.14/6.39 Search stopped by max_proofs option.
% 6.14/6.39
% 6.14/6.39 ============ end of search ============
% 6.14/6.39
% 6.14/6.39 ----------- soft-scott stats ----------
% 6.14/6.39
% 6.14/6.39 true clauses given 12 (20.3%)
% 6.14/6.39 false clauses given 47
% 6.14/6.39
% 6.14/6.39 FALSE TRUE
% 6.14/6.39 8 0 5
% 6.14/6.39 9 0 3
% 6.14/6.39 10 0 11
% 6.14/6.39 11 12 3
% 6.14/6.39 12 16 24
% 6.14/6.39 13 29 4
% 6.14/6.39 14 18 26
% 6.14/6.39 15 26 0
% 6.14/6.39 16 17 16
% 6.14/6.39 17 11 1
% 6.14/6.39 18 7 17
% 6.14/6.39 19 5 3
% 6.14/6.39 20 10 10
% 6.14/6.39 21 1 2
% 6.14/6.39 22 13 9
% 6.14/6.39 23 0 1
% 6.14/6.39 24 8 5
% 6.14/6.39 26 6 2
% 6.14/6.39 27 0 1
% 6.14/6.39 28 4 0
% 6.14/6.39 30 3 0
% 6.14/6.39 32 1 0
% 6.14/6.39 34 2 0
% 6.14/6.39 36 1 0
% 6.14/6.39 38 2 0
% 6.14/6.39 42 1 0
% 6.14/6.39 tot: 193 143 (42.6% true)
% 6.14/6.39
% 6.14/6.39
% 6.14/6.39 Model 8 [ 1 1 196 ] (0.00 seconds, 250000 Inserts)
% 6.14/6.39
% 6.14/6.39 That finishes the proof of the theorem.
% 6.14/6.39
% 6.14/6.39 Process 32192 finished Sat Jul 2 23:34:38 2022
%------------------------------------------------------------------------------