TSTP Solution File: LCL077-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL077-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:45 EDT 2022
% Result : Unsatisfiable 0.10s 0.37s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL077-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.11 % Command : sos-script %s
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sun Jul 3 12:52:55 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.10/0.33 ----- Otter 3.2, August 2001 -----
% 0.10/0.33 The process was started by sandbox on n027.cluster.edu,
% 0.10/0.33 Sun Jul 3 12:52:55 2022
% 0.10/0.33 The command was "./sos". The process ID is 5224.
% 0.10/0.33
% 0.10/0.33 set(prolog_style_variables).
% 0.10/0.33 set(auto).
% 0.10/0.33 dependent: set(auto1).
% 0.10/0.33 dependent: set(process_input).
% 0.10/0.33 dependent: clear(print_kept).
% 0.10/0.33 dependent: clear(print_new_demod).
% 0.10/0.33 dependent: clear(print_back_demod).
% 0.10/0.33 dependent: clear(print_back_sub).
% 0.10/0.33 dependent: set(control_memory).
% 0.10/0.33 dependent: assign(max_mem, 12000).
% 0.10/0.33 dependent: assign(pick_given_ratio, 4).
% 0.10/0.33 dependent: assign(stats_level, 1).
% 0.10/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.33 dependent: assign(sos_limit, 5000).
% 0.10/0.33 dependent: assign(max_weight, 60).
% 0.10/0.33 clear(print_given).
% 0.10/0.33
% 0.10/0.33 list(usable).
% 0.10/0.33
% 0.10/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.10/0.33
% 0.10/0.33 This is a Horn set without equality. The strategy will
% 0.10/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.10/0.33 in usable.
% 0.10/0.33
% 0.10/0.33 dependent: set(hyper_res).
% 0.10/0.33 dependent: clear(order_hyper).
% 0.10/0.33
% 0.10/0.33 ------------> process usable:
% 0.10/0.33
% 0.10/0.33 ------------> process sos:
% 0.10/0.33
% 0.10/0.33 ======= end of input processing =======
% 0.10/0.36
% 0.10/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.10/0.36
% 0.10/0.36 Stopped by limit on number of solutions
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 -------------- Softie stats --------------
% 0.10/0.36
% 0.10/0.36 UPDATE_STOP: 300
% 0.10/0.36 SFINDER_TIME_LIMIT: 2
% 0.10/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.36 number of clauses in intial UL: 2
% 0.10/0.36 number of clauses initially in problem: 5
% 0.10/0.36 percentage of clauses intially in UL: 40
% 0.10/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.10/0.36 percent of all initial clauses that are short: 100
% 0.10/0.36 absolute distinct symbol count: 4
% 0.10/0.36 distinct predicate count: 1
% 0.10/0.36 distinct function count: 2
% 0.10/0.36 distinct constant count: 1
% 0.10/0.36
% 0.10/0.36 ---------- no more Softie stats ----------
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 Model 2 (0.00 seconds, 0 Inserts)
% 0.10/0.36
% 0.10/0.36 Stopped by limit on number of solutions
% 0.10/0.36
% 0.10/0.36 =========== start of search ===========
% 0.10/0.37
% 0.10/0.37 -------- PROOF --------
% 0.10/0.37 % SZS status Unsatisfiable
% 0.10/0.37 % SZS output start Refutation
% 0.10/0.37
% 0.10/0.37 Model 3 (0.00 seconds, 0 Inserts)
% 0.10/0.37
% 0.10/0.37 Stopped by limit on number of solutions
% 0.10/0.37
% 0.10/0.37 ----> UNIT CONFLICT at 0.01 sec ----> 41 [binary,40.1,2.1] {+} $F.
% 0.10/0.37
% 0.10/0.37 Length of proof is 7. Level of proof is 6.
% 0.10/0.37
% 0.10/0.37 ---------------- PROOF ----------------
% 0.10/0.37 % SZS status Unsatisfiable
% 0.10/0.37 % SZS output start Refutation
% 0.10/0.37
% 0.10/0.37 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.10/0.37 2 [] {+} -is_a_theorem(implies(not(not(a)),a)).
% 0.10/0.37 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.10/0.37 4 [] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 0.10/0.37 5 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.10/0.37 7 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 0.10/0.37 13 [hyper,4,1,7] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 0.10/0.37 20 [hyper,13,1,3] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 0.10/0.37 21 [hyper,20,1,13] {-} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 0.10/0.37 25 [hyper,21,1,4] {-} is_a_theorem(implies(implies(not(not(A)),B),implies(not(not(A)),A))).
% 0.10/0.37 26 [hyper,21,1,3] {-} is_a_theorem(implies(A,implies(not(not(B)),implies(C,B)))).
% 0.10/0.37 40 [hyper,25,1,26] {-} is_a_theorem(implies(not(not(A)),A)).
% 0.10/0.37 41 [binary,40.1,2.1] {+} $F.
% 0.10/0.37
% 0.10/0.37 % SZS output end Refutation
% 0.10/0.37 ------------ end of proof -------------
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 Search stopped by max_proofs option.
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 Search stopped by max_proofs option.
% 0.10/0.37
% 0.10/0.37 ============ end of search ============
% 0.10/0.37
% 0.10/0.37 ----------- soft-scott stats ----------
% 0.10/0.37
% 0.10/0.37 true clauses given 3 (21.4%)
% 0.10/0.37 false clauses given 11
% 0.10/0.37
% 0.10/0.37 FALSE TRUE
% 0.10/0.37 4 0 1
% 0.10/0.37 9 0 3
% 0.10/0.37 10 0 4
% 0.10/0.37 12 2 0
% 0.10/0.37 14 2 0
% 0.10/0.37 16 2 1
% 0.10/0.37 18 1 0
% 0.10/0.37 20 1 1
% 0.10/0.37 22 1 0
% 0.10/0.37 tot: 9 10 (52.6% true)
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 Model 3 (0.00 seconds, 0 Inserts)
% 0.10/0.37
% 0.10/0.37 That finishes the proof of the theorem.
% 0.10/0.37
% 0.10/0.37 Process 5224 finished Sun Jul 3 12:52:55 2022
%------------------------------------------------------------------------------