TSTP Solution File: GRP047-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 : Sat Jul 16 11:41:12 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 12:13:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox2 on n025.cluster.edu,
% 0.20/0.35 Mon Jun 13 12:13:39 2022
% 0.20/0.35 The command was "./sos". The process ID is 23662.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.20/0.35
% 0.20/0.35 This is a Horn set with equality. The strategy will be
% 0.20/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.20/0.35 sos and nonpositive clauses in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(knuth_bendix).
% 0.20/0.35 dependent: set(para_from).
% 0.20/0.35 dependent: set(para_into).
% 0.20/0.35 dependent: clear(para_from_right).
% 0.20/0.35 dependent: clear(para_into_right).
% 0.20/0.35 dependent: set(para_from_vars).
% 0.20/0.35 dependent: set(eq_units_both_ways).
% 0.20/0.35 dependent: set(dynamic_demod_all).
% 0.20/0.35 dependent: set(dynamic_demod).
% 0.20/0.35 dependent: set(order_eq).
% 0.20/0.35 dependent: set(back_demod).
% 0.20/0.35 dependent: set(lrpo).
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: clear(order_hyper).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} -equalish(multiply(c,a),multiply(c,a)).
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 4
% 0.20/0.40 number of clauses initially in problem: 10
% 0.20/0.40 percentage of clauses intially in UL: 40
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 25
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 8
% 0.20/0.40 distinct predicate count: 2
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 4
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.20/0.40
% 0.20/0.40 -------- PROOF --------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 ----> UNIT CONFLICT at 0.02 sec ----> 15 [binary,14.1,13.1] {-} $F.
% 0.20/0.40
% 0.20/0.40 Length of proof is 4. Level of proof is 2.
% 0.20/0.40
% 0.20/0.40 ---------------- PROOF ----------------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 1 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 0.20/0.40 5 [] {-} -equalish(multiply(c,a),multiply(c,b)).
% 0.20/0.40 6 [copy,5,flip.1] {-} -equalish(multiply(c,b),multiply(c,a)).
% 0.20/0.40 7 [] {+} product(identity,A,A).
% 0.20/0.40 10 [] {-} equalish(a,b).
% 0.20/0.40 12,11 [copy,10,flip.1] {+} equalish(b,a).
% 0.20/0.40 13 [back_demod,6,demod,12] {-} -equalish(multiply(c,a),multiply(c,a)).
% 0.20/0.40 14 [hyper,7,1,7] {-} equalish(A,A).
% 0.20/0.40 15 [binary,14.1,13.1] {-} $F.
% 0.20/0.40
% 0.20/0.40 % SZS output end Refutation
% 0.20/0.40 ------------ end of proof -------------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40 ============ end of search ============
% 0.20/0.40
% 0.20/0.40 ----------- soft-scott stats ----------
% 0.20/0.40
% 0.20/0.40 true clauses given 0 (0.0%)
% 0.20/0.40 false clauses given 1
% 0.20/0.40
% 0.20/0.40 FALSE TRUE
% 0.20/0.40 3 0 1
% 0.20/0.40 5 1 0
% 0.20/0.40 6 1 0
% 0.20/0.40 7 1 0
% 0.20/0.40 tot: 3 1 (25.0% true)
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 That finishes the proof of the theorem.
% 0.20/0.40
% 0.20/0.40 Process 23662 finished Mon Jun 13 12:13:39 2022
%------------------------------------------------------------------------------