TSTP Solution File: NLP141-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP141-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:54:39 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 59 ( 17 unt; 0 nHn; 49 RR)
% Number of literals : 101 ( 4 equ; 47 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause60,axiom,
( member(X1,skf10(X2,X1),X2)
| ~ two(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause60) ).
cnf(clause89,negated_conjecture,
( frontseat(skc6,skf5(X2))
| ~ member(skc6,X1,skc7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause89) ).
cnf(clause75,negated_conjecture,
two(skc6,skc7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause75) ).
cnf(clause48,axiom,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause48) ).
cnf(clause49,axiom,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause49) ).
cnf(clause50,axiom,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause50) ).
cnf(clause30,axiom,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause31,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).
cnf(clause35,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).
cnf(clause92,negated_conjecture,
( be(skc6,skf6(X1),X1,skf5(X1))
| ~ member(skc6,X1,skc7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause92) ).
cnf(clause88,negated_conjecture,
( fellow(skc6,X1)
| ~ member(skc6,X1,skc7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause88) ).
cnf(clause52,axiom,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).
cnf(clause59,axiom,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause59) ).
cnf(clause2,axiom,
( man(X1,X2)
| ~ fellow(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(clause14,axiom,
( male(X1,X2)
| ~ man(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(c_0_15,plain,
( member(X1,skf10(X2,X1),X2)
| ~ two(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_16,negated_conjecture,
( frontseat(skc6,skf5(X2))
| ~ member(skc6,X1,skc7) ),
inference(fof_simplification,[status(thm)],[clause89]) ).
cnf(c_0_17,plain,
( member(X1,skf10(X2,X1),X2)
| ~ two(X1,X2) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
two(skc6,skc7),
clause75 ).
cnf(c_0_19,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause48]) ).
cnf(c_0_20,negated_conjecture,
( frontseat(skc6,skf5(X2))
| ~ member(skc6,X1,skc7) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
member(skc6,skf10(skc7,skc6),skc7),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause49]) ).
cnf(c_0_23,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
frontseat(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause50]) ).
cnf(c_0_26,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
seat(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_29,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
furniture(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause31]) ).
cnf(c_0_32,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
instrumentality(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_35,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
artifact(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( be(skc6,skf6(X1),X1,skf5(X1))
| ~ member(skc6,X1,skc7) ),
inference(fof_simplification,[status(thm)],[clause92]) ).
cnf(c_0_38,negated_conjecture,
( fellow(skc6,X1)
| ~ member(skc6,X1,skc7) ),
inference(fof_simplification,[status(thm)],[clause88]) ).
cnf(c_0_39,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_40,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
object(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_43,negated_conjecture,
( be(skc6,skf6(X1),X1,skf5(X1))
| ~ member(skc6,X1,skc7) ),
c_0_37 ).
cnf(c_0_44,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_45,negated_conjecture,
( fellow(skc6,X1)
| ~ member(skc6,X1,skc7) ),
c_0_38 ).
cnf(c_0_46,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
c_0_39 ).
cnf(c_0_47,negated_conjecture,
unisex(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
be(skc6,skf6(skf10(skc7,skc6)),skf10(skc7,skc6),skf5(skf10(skc7,skc6))),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_50,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause14]) ).
cnf(c_0_51,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
c_0_44 ).
cnf(c_0_52,negated_conjecture,
fellow(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_53,negated_conjecture,
~ male(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
skf5(skf10(skc7,skc6)) = skf10(skc7,skc6),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
man(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ male(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP141-1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 22:11:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9645 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.21/0.51 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 9650 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 92
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 92
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 92
% 0.21/0.51 # Processed clauses : 286
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 284
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 4
% 0.21/0.51 # Generated clauses : 129
% 0.21/0.51 # ...of the previous two non-redundant : 124
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 129
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 13
% 0.21/0.51 # ...of those cached : 2
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 188
% 0.21/0.51 # Positive orientable unit clauses : 95
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 23
% 0.21/0.51 # Non-unit-clauses : 70
% 0.21/0.51 # Current number of unprocessed clauses: 19
% 0.21/0.51 # ...number of literals in the above : 19
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 96
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 3119
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 2095
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 229
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 4
% 0.21/0.51 # BW rewrite match successes : 4
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3562
% 0.21/0.51 # Search garbage collected termcells : 173
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.016 s
% 0.21/0.51 # Maximum resident set size: 1772 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.051 s
% 0.21/0.51 # System time : 0.023 s
% 0.21/0.51 # Total time : 0.075 s
% 0.21/0.51 # Maximum resident set size: 1760 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------