TSTP Solution File: SYN980+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 : Thu Jul 21 12:16:46 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 13:17:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n017.cluster.edu,
% 0.12/0.35 Mon Jul 11 13:17:18 2022
% 0.12/0.35 The command was "./sos". The process ID is 27816.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 3
% 0.12/0.38 number of clauses initially in problem: 4
% 0.12/0.38 percentage of clauses intially in UL: 75
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 5
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 1
% 0.12/0.38 distinct constant count: 1
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.12/0.39
% 0.12/0.39 -------- PROOF --------
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output start Refutation
% 0.12/0.39
% 0.12/0.39 -----> EMPTY CLAUSE at 0.02 sec ----> 7 [hyper,6,3,5] {-} $F.
% 0.12/0.39
% 0.12/0.39 Length of proof is 2. Level of proof is 2.
% 0.12/0.39
% 0.12/0.39 ---------------- PROOF ----------------
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output start Refutation
% 0.12/0.39
% 0.12/0.39 1 [] {+} -r(A)|p(f(A),A).
% 0.12/0.39 2 [] {+} -p(A,B)|q(f($c1),$c1).
% 0.12/0.39 3 [] {+} -p(A,B)| -q(A,B).
% 0.12/0.39 4 [] {-} r($c1)|p(f(A),A).
% 0.12/0.39 5 [hyper,4,1,factor_simp] {-} p(f($c1),$c1).
% 0.12/0.39 6 [hyper,5,2] {+} q(f($c1),$c1).
% 0.12/0.39 7 [hyper,6,3,5] {-} $F.
% 0.12/0.39
% 0.12/0.39 % SZS output end Refutation
% 0.12/0.39 ------------ end of proof -------------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Search stopped by max_proofs option.
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Search stopped by max_proofs option.
% 0.12/0.39
% 0.12/0.39 ============ end of search ============
% 0.12/0.39
% 0.12/0.39 ----------- soft-scott stats ----------
% 0.12/0.39
% 0.12/0.39 true clauses given 1 (33.3%)
% 0.12/0.39 false clauses given 2
% 0.12/0.39
% 0.12/0.39 FALSE TRUE
% 0.12/0.39 tot: 0 0 (-nan% true)
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 That finishes the proof of the theorem.
% 0.12/0.39
% 0.12/0.39 Process 27816 finished Mon Jul 11 13:17:18 2022
%------------------------------------------------------------------------------