TSTP Solution File: CSR147+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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 23:23:45 EDT 2022
% Result : Theorem 0.47s 0.71s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 10 07:02:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n019.cluster.edu,
% 0.19/0.36 Fri Jun 10 07:02:40 2022
% 0.19/0.36 The command was "./sos". The process ID is 30258.
% 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 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 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: 6
% 0.19/0.39 number of clauses initially in problem: 16
% 0.19/0.39 percentage of clauses intially in UL: 37
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 71
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 14
% 0.19/0.39 distinct predicate count: 7
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 6
% 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.47/0.71
% 0.47/0.71 -------- PROOF --------
% 0.47/0.71 % SZS status Theorem
% 0.47/0.71 % SZS output start Refutation
% 0.47/0.71
% 0.47/0.71 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Model 4 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Model 5 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Model 6 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 7 [ 1 1 218 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 8 [ 1 0 94 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 9 [ 1 1 14906 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 -----> EMPTY CLAUSE at 0.33 sec ----> 38 [hyper,13,31,12,11] {-} $F.
% 0.47/0.71
% 0.47/0.71 Length of proof is 2. Level of proof is 2.
% 0.47/0.71
% 0.47/0.71 ---------------- PROOF ----------------
% 0.47/0.71 % SZS status Theorem
% 0.47/0.71 % SZS output start Refutation
% 0.47/0.71
% 0.47/0.71 3 [] {+} -s__Human(A)| -s__age(A,B)| -s__age(s__siblingFn(A),C)| -greater(B,C)|s__more_experienced(A,s__siblingFn(A))|s__has_seen_more(s__siblingFn(A),A).
% 0.47/0.71 5 [] {+} -s__has_seen_more(geoff,jim).
% 0.47/0.71 6 [] {+} -s__more_experienced(jim,geoff).
% 0.47/0.71 10 [] {+} s__Human(jim).
% 0.47/0.71 11 [] {+} s__age(geoff,n48).
% 0.47/0.71 12 [] {+} s__age(jim,n54).
% 0.47/0.71 13 [] {+} greater(n54,n48).
% 0.47/0.71 14 [] {-} geoff=s__siblingFn(jim).
% 0.47/0.71 16,15 [copy,14,flip.1] {+} s__siblingFn(jim)=geoff.
% 0.47/0.71 31 [para_from,15.1.1,3.6.1,demod,16,16,unit_del,10,6,5] {-} -s__age(jim,A)| -s__age(geoff,B)| -greater(A,B).
% 0.47/0.71 38 [hyper,13,31,12,11] {-} $F.
% 0.47/0.71
% 0.47/0.71 % SZS output end Refutation
% 0.47/0.71 ------------ end of proof -------------
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Search stopped by max_proofs option.
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Search stopped by max_proofs option.
% 0.47/0.71
% 0.47/0.71 ============ end of search ============
% 0.47/0.71
% 0.47/0.71 ----------- soft-scott stats ----------
% 0.47/0.71
% 0.47/0.71 true clauses given 2 (18.2%)
% 0.47/0.71 false clauses given 9
% 0.47/0.71
% 0.47/0.71 FALSE TRUE
% 0.47/0.71 2 0 1
% 0.47/0.71 3 0 3
% 0.47/0.71 8 0 1
% 0.47/0.71 9 0 3
% 0.47/0.71 10 0 5
% 0.47/0.71 11 0 1
% 0.47/0.71 12 0 2
% 0.47/0.71 15 1 0
% 0.47/0.71 16 1 0
% 0.47/0.71 tot: 2 16 (88.9% true)
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Model 9 [ 1 1 14906 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 That finishes the proof of the theorem.
% 0.47/0.71
% 0.47/0.71 Process 30258 finished Fri Jun 10 07:02:40 2022
%------------------------------------------------------------------------------