TSTP Solution File: LCL092-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:52 EDT 2022
% Result : Unsatisfiable 1.82s 1.99s
% Output : Refutation 1.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jul 3 01:14:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.14/0.35 Sun Jul 3 01:14:02 2022
% 0.14/0.35 The command was "./sos". The process ID is 19917.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.35
% 0.14/0.35 This is a Horn set without equality. The strategy will
% 0.14/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.35 in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: clear(order_hyper).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35
% 0.14/0.35 ======= 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.82/1.99
% 1.82/1.99 -------- PROOF --------
% 1.82/1.99 % SZS status Unsatisfiable
% 1.82/1.99 % SZS output start Refutation
% 1.82/1.99
% 1.82/1.99 Model 2 (0.00 seconds, 0 Inserts)
% 1.82/1.99
% 1.82/1.99 Stopped by limit on number of solutions
% 1.82/1.99
% 1.82/1.99 Model 3 (0.00 seconds, 0 Inserts)
% 1.82/1.99
% 1.82/1.99 Stopped by limit on number of solutions
% 1.82/1.99
% 1.82/1.99 Model 4 (0.00 seconds, 0 Inserts)
% 1.82/1.99
% 1.82/1.99 Stopped by limit on number of solutions
% 1.82/1.99
% 1.82/1.99 Model 5 (0.00 seconds, 0 Inserts)
% 1.82/1.99
% 1.82/1.99 Stopped by limit on number of solutions
% 1.82/1.99
% 1.82/1.99 ----> UNIT CONFLICT at 1.60 sec ----> 581 [binary,580.1,2.1] {+} $F.
% 1.82/1.99
% 1.82/1.99 Length of proof is 24. Level of proof is 21.
% 1.82/1.99
% 1.82/1.99 ---------------- PROOF ----------------
% 1.82/1.99 % SZS status Unsatisfiable
% 1.82/1.99 % SZS output start Refutation
% 1.82/1.99
% 1.82/1.99 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.82/1.99 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.82/1.99 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 1.82/1.99 4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))).
% 1.82/1.99 5 [hyper,4,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))).
% 1.82/1.99 7 [hyper,5,1,5] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))).
% 1.82/1.99 11 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))).
% 1.82/1.99 18 [hyper,11,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))).
% 1.82/1.99 21 [hyper,11,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,implies(E,C)))))).
% 1.82/1.99 54 [hyper,18,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))).
% 1.82/1.99 56 [hyper,21,1,21] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,implies(D,B))))).
% 1.82/1.99 63 [hyper,56,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(implies(D,F),C),D)))).
% 1.82/1.99 106 [hyper,54,1,54] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))).
% 1.82/1.99 109 [hyper,106,1,106] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))).
% 1.82/1.99 114 [hyper,109,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))).
% 1.82/1.99 122 [hyper,114,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))).
% 1.82/1.99 371 [hyper,122,1,114] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))).
% 1.82/1.99 378 [hyper,371,1,371] {+} is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))).
% 1.82/1.99 387 [hyper,378,1,378] {+} is_a_theorem(implies(implies(A,A),implies(A,A))).
% 1.82/1.99 400 [hyper,387,1,122] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 1.82/1.99 402 [hyper,400,1,400] {+} is_a_theorem(implies(A,implies(B,B))).
% 1.82/1.99 451 [hyper,402,1,3] {+} is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))).
% 1.82/1.99 525 [hyper,451,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,implies(D,A)))).
% 1.82/1.99 548 [hyper,525,1,63] {-} is_a_theorem(implies(A,implies(B,implies(C,implies(implies(implies(D,E),D),D))))).
% 1.82/1.99 553 [hyper,548,1,548] {-} is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),C),C)))).
% 1.82/1.99 577 [hyper,553,1,553] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 1.82/1.99 580 [hyper,577,1,577] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 1.82/1.99 581 [binary,580.1,2.1] {+} $F.
% 1.82/1.99
% 1.82/1.99 % SZS output end Refutation
% 1.82/1.99 ------------ end of proof -------------
% 1.82/1.99
% 1.82/1.99
% 1.82/1.99 Search stopped by max_proofs option.
% 1.82/1.99
% 1.82/1.99
% 1.82/1.99 Search stopped by max_proofs option.
% 1.82/1.99
% 1.82/1.99 ============ end of search ============
% 1.82/1.99
% 1.82/1.99 ----------- soft-scott stats ----------
% 1.82/1.99
% 1.82/1.99 true clauses given 8 (9.6%)
% 1.82/1.99 false clauses given 75
% 1.82/1.99
% 1.82/1.99 FALSE TRUE
% 1.82/1.99 10 0 1
% 1.82/1.99 12 0 3
% 1.82/1.99 14 0 6
% 1.82/1.99 16 3 11
% 1.82/1.99 18 5 20
% 1.82/1.99 20 13 24
% 1.82/1.99 22 14 29
% 1.82/1.99 24 13 31
% 1.82/1.99 26 16 21
% 1.82/1.99 28 10 13
% 1.82/1.99 30 6 8
% 1.82/1.99 32 5 3
% 1.82/1.99 34 7 1
% 1.82/1.99 36 3 2
% 1.82/1.99 38 4 1
% 1.82/1.99 40 3 0
% 1.82/1.99 42 2 0
% 1.82/1.99 tot: 104 174 (62.6% true)
% 1.82/1.99
% 1.82/1.99
% 1.82/1.99 Model 5 (0.00 seconds, 0 Inserts)
% 1.82/1.99
% 1.82/1.99 That finishes the proof of the theorem.
% 1.82/1.99
% 1.82/1.99 Process 19917 finished Sun Jul 3 01:14:04 2022
%------------------------------------------------------------------------------