TSTP Solution File: NLP208-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP208-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 00:57:44 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 15 unt; 0 nHn; 39 RR)
% Number of literals : 63 ( 4 equ; 28 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 54 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause10,axiom,
( device(X1,X2)
| ~ wheel(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause67,axiom,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause67) ).
cnf(clause11,axiom,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(clause98,negated_conjecture,
wheel(skc11,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause98) ).
cnf(clause106,negated_conjecture,
be(skc11,skc13,skc15,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause106) ).
cnf(clause12,axiom,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause34,axiom,
( male(X1,X2)
| ~ man(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).
cnf(clause94,negated_conjecture,
man(skc11,skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause94) ).
cnf(clause13,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
cnf(clause60,axiom,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).
cnf(clause20,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).
cnf(c_0_11,plain,
( device(X1,X2)
| ~ wheel(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause10]) ).
cnf(c_0_12,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_13,plain,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause11]) ).
cnf(c_0_14,plain,
( device(X1,X2)
| ~ wheel(X1,X2) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
wheel(skc11,skc12),
clause98 ).
cnf(c_0_16,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
be(skc11,skc13,skc15,skc12),
clause106 ).
cnf(c_0_18,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause12]) ).
cnf(c_0_19,plain,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
device(skc11,skc12),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_22,negated_conjecture,
man(skc11,skc15),
clause94 ).
cnf(c_0_23,negated_conjecture,
skc15 = skc12,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause13]) ).
cnf(c_0_25,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
instrumentality(skc11,skc12),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_28,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
man(skc11,skc12),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_31,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
artifact(skc11,skc12),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
male(skc11,skc12),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
object(skc11,skc12),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ unisex(skc11,skc12),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP208-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.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 : 300
% 0.12/0.33 % DateTime : Sun May 19 21:51:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25788 completed with status 0
% 0.19/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.19/0.48 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.19/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 25793 completed with status 0
% 0.19/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.19/0.48 # Preprocessing time : 0.002 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 120
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 120
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 120
% 0.19/0.48 # Processed clauses : 307
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 304
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 5
% 0.19/0.48 # Generated clauses : 105
% 0.19/0.48 # ...of the previous two non-redundant : 99
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 105
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 18
% 0.19/0.48 # ...of those cached : 7
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 179
% 0.19/0.48 # Positive orientable unit clauses : 81
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 6
% 0.19/0.48 # Non-unit-clauses : 92
% 0.19/0.48 # Current number of unprocessed clauses: 28
% 0.19/0.48 # ...number of literals in the above : 37
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 125
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 7486
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 5240
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 447
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 2
% 0.19/0.48 # BW rewrite match successes : 2
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 4242
% 0.19/0.48 # Search garbage collected termcells : 229
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.011 s
% 0.19/0.48 # System time : 0.005 s
% 0.19/0.48 # Total time : 0.016 s
% 0.19/0.48 # Maximum resident set size: 1820 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.057 s
% 0.19/0.48 # System time : 0.011 s
% 0.19/0.48 # Total time : 0.068 s
% 0.19/0.48 # Maximum resident set size: 1780 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------