TSTP Solution File: SWV001-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV001-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 300s
% DateTime : Tue May 21 05:32:51 EDT 2024
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 8 unt; 6 nHn; 27 RR)
% Number of literals : 74 ( 0 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 54 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_3,axiom,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,axiom,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_4,axiom,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_2,axiom,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_7,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(less_or_equal_reflexivity,axiom,
less_or_equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
cnf(clause_6,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(all_less_or_equal,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
cnf(c_0_9,plain,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_10,plain,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_11,plain,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_12,plain,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
c_0_10 ).
cnf(c_0_13,plain,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,plain,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_15,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_16,plain,
( q4(X1,X2,X2)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
q1(a,b,c),
clause_5 ).
cnf(c_0_18,plain,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_19,plain,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( q4(a,b,b)
| ~ less_or_equalish(a,b) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
less_or_equalish(X1,X1),
less_or_equal_reflexivity ).
cnf(c_0_23,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_24,plain,
( q4(X1,X2,X1)
| less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ less_or_equalish(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
q4(a,b,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ less_or_equalish(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]) ).
cnf(c_0_29,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
all_less_or_equal ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWV001-1 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 06:56:07 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.36 Running first-order model finding
% 0.12/0.36 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Version: 3.1.0
% 0.12/0.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.37 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.37 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.37 # Starting sh5l with 300s (1) cores
% 0.12/0.37 # new_bool_3 with pid 19146 completed with status 0
% 0.12/0.37 # Result found by new_bool_3
% 0.12/0.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.37 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.37 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.12/0.37 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.37 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.37 # SAT001_MinMin_p005000_rr_RG with pid 19151 completed with status 0
% 0.12/0.37 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.37 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.37 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.12/0.37 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.37 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.37 # Preprocessing time : 0.001 s
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37
% 0.12/0.37 # Proof found!
% 0.12/0.37 # SZS status Unsatisfiable
% 0.12/0.37 # SZS output start CNFRefutation
% See solution above
% 0.12/0.37 # Parsed axioms : 14
% 0.12/0.37 # Removed by relevancy pruning/SinE : 4
% 0.12/0.37 # Initial clauses : 10
% 0.12/0.37 # Removed in clause preprocessing : 0
% 0.12/0.37 # Initial clauses in saturation : 10
% 0.12/0.37 # Processed clauses : 30
% 0.12/0.37 # ...of these trivial : 0
% 0.12/0.37 # ...subsumed : 2
% 0.12/0.37 # ...remaining for further processing : 28
% 0.12/0.37 # Other redundant clauses eliminated : 0
% 0.12/0.37 # Clauses deleted for lack of memory : 0
% 0.12/0.37 # Backward-subsumed : 1
% 0.12/0.37 # Backward-rewritten : 0
% 0.12/0.37 # Generated clauses : 33
% 0.12/0.37 # ...of the previous two non-redundant : 20
% 0.12/0.37 # ...aggressively subsumed : 0
% 0.12/0.37 # Contextual simplify-reflections : 0
% 0.12/0.37 # Paramodulations : 25
% 0.12/0.37 # Factorizations : 8
% 0.12/0.37 # NegExts : 0
% 0.12/0.37 # Equation resolutions : 0
% 0.12/0.37 # Disequality decompositions : 0
% 0.12/0.37 # Total rewrite steps : 12
% 0.12/0.37 # ...of those cached : 3
% 0.12/0.37 # Propositional unsat checks : 0
% 0.12/0.37 # Propositional check models : 0
% 0.12/0.37 # Propositional check unsatisfiable : 0
% 0.12/0.37 # Propositional clauses : 0
% 0.12/0.37 # Propositional clauses after purity: 0
% 0.12/0.37 # Propositional unsat core size : 0
% 0.12/0.37 # Propositional preprocessing time : 0.000
% 0.12/0.37 # Propositional encoding time : 0.000
% 0.12/0.37 # Propositional solver time : 0.000
% 0.12/0.37 # Success case prop preproc time : 0.000
% 0.12/0.37 # Success case prop encoding time : 0.000
% 0.12/0.37 # Success case prop solver time : 0.000
% 0.12/0.37 # Current number of processed clauses : 17
% 0.12/0.37 # Positive orientable unit clauses : 3
% 0.12/0.37 # Positive unorientable unit clauses: 0
% 0.12/0.37 # Negative unit clauses : 2
% 0.12/0.37 # Non-unit-clauses : 12
% 0.12/0.37 # Current number of unprocessed clauses: 8
% 0.12/0.37 # ...number of literals in the above : 29
% 0.12/0.37 # Current number of archived formulas : 0
% 0.12/0.37 # Current number of archived clauses : 11
% 0.12/0.37 # Clause-clause subsumption calls (NU) : 35
% 0.12/0.37 # Rec. Clause-clause subsumption calls : 35
% 0.12/0.37 # Non-unit clause-clause subsumptions : 2
% 0.12/0.37 # Unit Clause-clause subsumption calls : 6
% 0.12/0.37 # Rewrite failures with RHS unbound : 0
% 0.12/0.37 # BW rewrite match attempts : 1
% 0.12/0.37 # BW rewrite match successes : 0
% 0.12/0.37 # Condensation attempts : 0
% 0.12/0.37 # Condensation successes : 0
% 0.12/0.37 # Termbank termtop insertions : 684
% 0.12/0.37 # Search garbage collected termcells : 44
% 0.12/0.37
% 0.12/0.37 # -------------------------------------------------
% 0.12/0.37 # User time : 0.001 s
% 0.12/0.37 # System time : 0.003 s
% 0.12/0.37 # Total time : 0.003 s
% 0.12/0.37 # Maximum resident set size: 1600 pages
% 0.12/0.37
% 0.12/0.37 # -------------------------------------------------
% 0.12/0.37 # User time : 0.002 s
% 0.12/0.37 # System time : 0.003 s
% 0.12/0.37 # Total time : 0.005 s
% 0.12/0.37 # Maximum resident set size: 1696 pages
% 0.12/0.37 % E---3.1 exiting
%------------------------------------------------------------------------------