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