TSTP Solution File: LCL065-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n011.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 : Mon Jul 4 00:11:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n011.cluster.edu,
% 0.19/0.36 Mon Jul 4 00:11:36 2022
% 0.19/0.36 The command was "./sos". The process ID is 20368.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set without equality. The strategy will
% 0.19/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36 in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 5
% 0.19/0.39 percentage of clauses intially in UL: 40
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 4
% 0.19/0.39 distinct predicate count: 1
% 0.19/0.39 distinct function count: 2
% 0.19/0.39 distinct constant count: 1
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 ----> UNIT CONFLICT at 0.04 sec ----> 113 [binary,112.1,2.1] {+} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 13. Level of proof is 9.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.43 2 [] {+} -is_a_theorem(implies(implies(not(a),a),a)).
% 0.19/0.43 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.19/0.43 4 [] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 0.19/0.43 5 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.19/0.43 7 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 0.19/0.43 11 [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)))).
% 0.19/0.43 13 [hyper,4,1,7] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 0.19/0.43 16 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 0.19/0.43 20 [hyper,13,1,3] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 0.19/0.43 21 [hyper,20,1,13] {-} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 0.19/0.43 22 [hyper,20,1,4] {-} is_a_theorem(implies(implies(not(A),A),implies(not(A),B))).
% 0.19/0.43 26 [hyper,21,1,3] {-} is_a_theorem(implies(A,implies(not(not(B)),implies(C,B)))).
% 0.19/0.43 36 [hyper,16,1,26] {+} is_a_theorem(implies(A,A)).
% 0.19/0.43 47 [hyper,36,1,3] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.19/0.43 66 [hyper,22,1,13] {-} is_a_theorem(implies(implies(not(A),A),implies(B,A))).
% 0.19/0.43 101 [hyper,47,1,11] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 0.19/0.43 112 [hyper,101,1,66] {-} is_a_theorem(implies(implies(not(A),A),A)).
% 0.19/0.43 113 [binary,112.1,2.1] {+} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 6 (22.2%)
% 0.19/0.43 false clauses given 21
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 6 0 1
% 0.19/0.43 7 0 1
% 0.19/0.43 8 0 7
% 0.19/0.43 9 0 4
% 0.19/0.43 10 0 3
% 0.19/0.43 11 0 2
% 0.19/0.43 12 2 10
% 0.19/0.43 13 6 3
% 0.19/0.43 14 3 4
% 0.19/0.43 15 1 1
% 0.19/0.43 16 4 3
% 0.19/0.43 17 0 2
% 0.19/0.43 18 4 5
% 0.19/0.43 20 2 1
% 0.19/0.43 22 1 2
% 0.19/0.43 24 0 1
% 0.19/0.43 30 0 1
% 0.19/0.43 tot: 23 51 (68.9% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 20368 finished Mon Jul 4 00:11:36 2022
%------------------------------------------------------------------------------