TSTP Solution File: COM004-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM004-1 : TPTP v8.1.0. Released v1.1.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 : Fri Jul 15 01:43:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 : Thu Jun 16 19:30:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n010.cluster.edu,
% 0.13/0.36 Thu Jun 16 19:30:38 2022
% 0.13/0.36 The command was "./sos". The process ID is 1471.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 12
% 0.13/0.39 percentage of clauses intially in UL: 16
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 42
% 0.13/0.39 percent of all initial clauses that are short: 91
% 0.13/0.39 absolute distinct symbol count: 14
% 0.13/0.39 distinct predicate count: 4
% 0.13/0.39 distinct function count: 5
% 0.13/0.39 distinct constant count: 5
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 ----> UNIT CONFLICT at 0.04 sec ----> 17 [binary,16.1,2.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 4. Level of proof is 3.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 1 [] {+} failure_node(parent_of(A,B),or(C,D))| -failure_node(A,or(C,E))| -failure_node(B,or(D,F))| -contradictory(E,F)| -siblings(A,B).
% 0.20/0.42 2 [] {+} -failure_node(A,or(empty,empty)).
% 0.20/0.42 4 [] {+} contradictory(A,negate(A)).
% 0.20/0.42 5 [] {+} siblings(left_child_of(A),right_child_of(A)).
% 0.20/0.42 6 [] {-} failure_node(n_left,or(empty,atom)).
% 0.20/0.42 7 [] {-} failure_node(n_right,or(empty,negate(atom))).
% 0.20/0.42 8 [] {-} n_left=left_child_of(n).
% 0.20/0.42 9 [copy,8,flip.1] {+} left_child_of(n)=n_left.
% 0.20/0.42 11 [] {-} n_right=right_child_of(n).
% 0.20/0.42 13,12 [copy,11,flip.1] {+} right_child_of(n)=n_right.
% 0.20/0.42 15 [para_into,5.1.1,9.1.1,demod,13] {+} siblings(n_left,n_right).
% 0.20/0.42 16 [hyper,15,1,6,7,4] {-} failure_node(parent_of(n_left,n_right),or(empty,empty)).
% 0.20/0.42 17 [binary,16.1,2.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 3 (33.3%)
% 0.20/0.42 false clauses given 6
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 tot: 0 0 (-nan% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 1471 finished Thu Jun 16 19:30:38 2022
%------------------------------------------------------------------------------