TSTP Solution File: LCL169-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:28:18 EDT 2022
% Result : Unsatisfiable 1.21s 1.45s
% Output : Refutation 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% 0.00/0.11 % Command : sos-script %s
% 0.10/0.32 % Computer : n010.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Mon Jul 4 06:51:32 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.17/0.33 ----- Otter 3.2, August 2001 -----
% 0.17/0.33 The process was started by sandbox on n010.cluster.edu,
% 0.17/0.33 Mon Jul 4 06:51:32 2022
% 0.17/0.33 The command was "./sos". The process ID is 21186.
% 0.17/0.33
% 0.17/0.33 set(prolog_style_variables).
% 0.17/0.33 set(auto).
% 0.17/0.33 dependent: set(auto1).
% 0.17/0.33 dependent: set(process_input).
% 0.17/0.33 dependent: clear(print_kept).
% 0.17/0.33 dependent: clear(print_new_demod).
% 0.17/0.33 dependent: clear(print_back_demod).
% 0.17/0.33 dependent: clear(print_back_sub).
% 0.17/0.33 dependent: set(control_memory).
% 0.17/0.33 dependent: assign(max_mem, 12000).
% 0.17/0.33 dependent: assign(pick_given_ratio, 4).
% 0.17/0.33 dependent: assign(stats_level, 1).
% 0.17/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.33 dependent: assign(sos_limit, 5000).
% 0.17/0.33 dependent: assign(max_weight, 60).
% 0.17/0.33 clear(print_given).
% 0.17/0.33
% 0.17/0.33 list(usable).
% 0.17/0.33
% 0.17/0.33 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.17/0.33
% 0.17/0.33 This is a Horn set with equality. The strategy will be
% 0.17/0.33 Knuth-Bendix and hyper_res, with positive clauses in
% 0.17/0.33 sos and nonpositive clauses in usable.
% 0.17/0.33
% 0.17/0.33 dependent: set(knuth_bendix).
% 0.17/0.33 dependent: set(para_from).
% 0.17/0.33 dependent: set(para_into).
% 0.17/0.33 dependent: clear(para_from_right).
% 0.17/0.33 dependent: clear(para_into_right).
% 0.17/0.33 dependent: set(para_from_vars).
% 0.17/0.33 dependent: set(eq_units_both_ways).
% 0.17/0.33 dependent: set(dynamic_demod_all).
% 0.17/0.33 dependent: set(dynamic_demod).
% 0.17/0.33 dependent: set(order_eq).
% 0.17/0.33 dependent: set(back_demod).
% 0.17/0.33 dependent: set(lrpo).
% 0.17/0.33 dependent: set(hyper_res).
% 0.17/0.33 dependent: clear(order_hyper).
% 0.17/0.33
% 0.17/0.33 ------------> process usable:
% 0.17/0.33
% 0.17/0.33 ------------> process sos:
% 0.17/0.33 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.17/0.33
% 0.17/0.33 ======= end of input processing =======
% 0.17/0.37
% 0.17/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.37
% 0.17/0.37 Stopped by limit on number of solutions
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37 -------------- Softie stats --------------
% 0.17/0.37
% 0.17/0.37 UPDATE_STOP: 300
% 0.17/0.37 SFINDER_TIME_LIMIT: 2
% 0.17/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.37 number of clauses in intial UL: 3
% 0.17/0.37 number of clauses initially in problem: 11
% 0.17/0.37 percentage of clauses intially in UL: 27
% 0.17/0.37 percentage of distinct symbols occuring in initial UL: 71
% 0.17/0.37 percent of all initial clauses that are short: 100
% 0.17/0.37 absolute distinct symbol count: 7
% 0.17/0.37 distinct predicate count: 3
% 0.17/0.37 distinct function count: 3
% 0.17/0.37 distinct constant count: 1
% 0.17/0.37
% 0.17/0.37 ---------- no more Softie stats ----------
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.37
% 0.17/0.37 Stopped by limit on number of solutions
% 0.17/0.37
% 0.17/0.37 =========== start of search ===========
% 1.21/1.45
% 1.21/1.45 -------- PROOF --------
% 1.21/1.45 % SZS status Unsatisfiable
% 1.21/1.45 % SZS output start Refutation
% 1.21/1.45
% 1.21/1.45 Model 3 (0.00 seconds, 0 Inserts)
% 1.21/1.45
% 1.21/1.45 Stopped by limit on number of solutions
% 1.21/1.45
% 1.21/1.45 Model 4 (0.00 seconds, 0 Inserts)
% 1.21/1.45
% 1.21/1.45 Stopped by limit on number of solutions
% 1.21/1.45
% 1.21/1.45 Stopped by limit on insertions
% 1.21/1.45
% 1.21/1.45 Stopped by limit on insertions
% 1.21/1.45
% 1.21/1.45 Stopped by limit on insertions
% 1.21/1.45
% 1.21/1.45 Model 5 [ 1 1 611 ] (0.00 seconds, 250000 Inserts)
% 1.21/1.45
% 1.21/1.45 Stopped by limit on insertions
% 1.21/1.46
% 1.21/1.46 Model 6 [ 31 1 4852 ] (0.00 seconds, 250000 Inserts)
% 1.21/1.46
% 1.21/1.46 ----> UNIT CONFLICT at 1.10 sec ----> 27 [binary,26.1,3.1] {-} $F.
% 1.21/1.46
% 1.21/1.46 Length of proof is 3. Level of proof is 2.
% 1.21/1.46
% 1.21/1.46 ---------------- PROOF ----------------
% 1.21/1.46 % SZS status Unsatisfiable
% 1.21/1.46 % SZS output start Refutation
% 1.21/1.46
% 1.21/1.46 1 [] {+} theorem(A)| -axiom(A).
% 1.21/1.46 3 [] {+} -theorem(implies(implies(p,not(p)),not(p))).
% 1.21/1.46 4 [] {+} axiom(implies(or(A,A),A)).
% 1.21/1.46 9 [] {-} implies(A,B)=or(not(A),B).
% 1.21/1.46 10 [copy,9,flip.1] {-} or(not(A),B)=implies(A,B).
% 1.21/1.46 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 1.21/1.46 26 [para_into,13.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(A)),not(A))).
% 1.21/1.46 27 [binary,26.1,3.1] {-} $F.
% 1.21/1.46
% 1.21/1.46 % SZS output end Refutation
% 1.21/1.46 ------------ end of proof -------------
% 1.21/1.46
% 1.21/1.46
% 1.21/1.46 Search stopped by max_proofs option.
% 1.21/1.46
% 1.21/1.46
% 1.21/1.46 Search stopped by max_proofs option.
% 1.21/1.46
% 1.21/1.46 ============ end of search ============
% 1.21/1.46
% 1.21/1.46 ----------- soft-scott stats ----------
% 1.21/1.46
% 1.21/1.46 true clauses given 1 (11.1%)
% 1.21/1.46 false clauses given 8
% 1.21/1.46
% 1.21/1.46 FALSE TRUE
% 1.21/1.46 6 0 1
% 1.21/1.46 8 2 1
% 1.21/1.46 9 2 0
% 1.21/1.46 12 4 0
% 1.21/1.46 tot: 8 2 (20.0% true)
% 1.21/1.46
% 1.21/1.46
% 1.21/1.46 Model 6 [ 31 1 4852 ] (0.00 seconds, 250000 Inserts)
% 1.21/1.46
% 1.21/1.46 That finishes the proof of the theorem.
% 1.21/1.46
% 1.21/1.46 Process 21186 finished Mon Jul 4 06:51:33 2022
%------------------------------------------------------------------------------