TSTP Solution File: CSR066+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR066+3 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Mon May 20 19:17:57 EDT 2024
% Result : Theorem 0.41s 0.65s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 17 ~; 13 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 26 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax2_453,axiom,
! [X7,X8,X9,X10] :
( ( isa(X7,X8)
& relationexistsall(X9,X10,X8) )
=> isa(f_relationexistsallfn(X7,X9,X10,X8),X10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_453) ).
fof(ax2_7743,axiom,
! [X15] :
( shavingrazor_manual(X15)
=> isa(X15,c_shavingrazor_manual) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7743) ).
fof(query166,conjecture,
? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query166) ).
fof(ax2_3628,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3628) ).
fof(ax2_195,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_195) ).
fof(ax2_3627,axiom,
! [X7] :
( shavingrazor_manual(X7)
=> tptp_8_271(f_relationexistsallfn(X7,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3627) ).
fof(ax2_5089,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_25972)
=> tptpcol_16_25972(X15) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_5089) ).
fof(c_0_7,plain,
! [X35,X36,X37,X38] :
( ~ isa(X35,X36)
| ~ relationexistsall(X37,X38,X36)
| isa(f_relationexistsallfn(X35,X37,X38,X36),X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_453])])]) ).
fof(c_0_8,plain,
! [X31] :
( ~ shavingrazor_manual(X31)
| isa(X31,c_shavingrazor_manual) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7743])])]) ).
fof(c_0_9,negated_conjecture,
~ ? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
inference(assume_negation,[status(cth)],[query166]) ).
cnf(c_0_10,plain,
( isa(f_relationexistsallfn(X1,X3,X4,X2),X4)
| ~ isa(X1,X2)
| ~ relationexistsall(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_3628]) ).
cnf(c_0_12,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_195]) ).
fof(c_0_14,negated_conjecture,
! [X23] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptp_8_271(X23,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X23) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,plain,
! [X28] :
( ~ shavingrazor_manual(X28)
| tptp_8_271(f_relationexistsallfn(X28,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3627])])]) ).
fof(c_0_16,plain,
! [X24] :
( ~ isa(X24,c_tptpcol_16_25972)
| tptpcol_16_25972(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_5089])])]) ).
cnf(c_0_17,plain,
( isa(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)
| ~ isa(X1,c_shavingrazor_manual) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR066+3 : TPTP v8.2.0. Released v3.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 00:49:23 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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.41/0.64 # Version: 3.1.0
% 0.41/0.64 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.41/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.41/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.64 # Starting sh5l with 300s (1) cores
% 0.41/0.64 # new_bool_3 with pid 21062 completed with status 0
% 0.41/0.64 # Result found by new_bool_3
% 0.41/0.64 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.41/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.41/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.64 # Search class: FHHNS-FFSM32-MFFFFFNN
% 0.41/0.64 # partial match(1): FHHNS-FFMM32-MFFFFFNN
% 0.41/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.41/0.64 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 21065 completed with status 0
% 0.41/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.41/0.64 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.41/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.65 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.41/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.65 # Search class: FHHNS-FFSM32-MFFFFFNN
% 0.41/0.65 # partial match(1): FHHNS-FFMM32-MFFFFFNN
% 0.41/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.41/0.65 # Preprocessing time : 0.007 s
% 0.41/0.65 # Presaturation interreduction done
% 0.41/0.65
% 0.41/0.65 # Proof found!
% 0.41/0.65 # SZS status Theorem
% 0.41/0.65 # SZS output start CNFRefutation
% See solution above
% 0.41/0.65 # Parsed axioms : 8006
% 0.41/0.65 # Removed by relevancy pruning/SinE : 7978
% 0.41/0.65 # Initial clauses : 29
% 0.41/0.65 # Removed in clause preprocessing : 0
% 0.41/0.65 # Initial clauses in saturation : 29
% 0.41/0.65 # Processed clauses : 71
% 0.41/0.65 # ...of these trivial : 4
% 0.41/0.65 # ...subsumed : 2
% 0.41/0.65 # ...remaining for further processing : 65
% 0.41/0.65 # Other redundant clauses eliminated : 0
% 0.41/0.65 # Clauses deleted for lack of memory : 0
% 0.41/0.65 # Backward-subsumed : 0
% 0.41/0.65 # Backward-rewritten : 0
% 0.41/0.65 # Generated clauses : 27
% 0.41/0.65 # ...of the previous two non-redundant : 18
% 0.41/0.65 # ...aggressively subsumed : 0
% 0.41/0.65 # Contextual simplify-reflections : 0
% 0.41/0.65 # Paramodulations : 27
% 0.41/0.65 # Factorizations : 0
% 0.41/0.65 # NegExts : 0
% 0.41/0.65 # Equation resolutions : 0
% 0.41/0.65 # Disequality decompositions : 0
% 0.41/0.65 # Total rewrite steps : 15
% 0.41/0.65 # ...of those cached : 8
% 0.41/0.65 # Propositional unsat checks : 0
% 0.41/0.65 # Propositional check models : 0
% 0.41/0.65 # Propositional check unsatisfiable : 0
% 0.41/0.65 # Propositional clauses : 0
% 0.41/0.65 # Propositional clauses after purity: 0
% 0.41/0.65 # Propositional unsat core size : 0
% 0.41/0.65 # Propositional preprocessing time : 0.000
% 0.41/0.65 # Propositional encoding time : 0.000
% 0.41/0.65 # Propositional solver time : 0.000
% 0.41/0.65 # Success case prop preproc time : 0.000
% 0.41/0.65 # Success case prop encoding time : 0.000
% 0.41/0.65 # Success case prop solver time : 0.000
% 0.41/0.65 # Current number of processed clauses : 41
% 0.41/0.65 # Positive orientable unit clauses : 20
% 0.41/0.65 # Positive unorientable unit clauses: 0
% 0.41/0.65 # Negative unit clauses : 1
% 0.41/0.65 # Non-unit-clauses : 20
% 0.41/0.65 # Current number of unprocessed clauses: 0
% 0.41/0.65 # ...number of literals in the above : 0
% 0.41/0.65 # Current number of archived formulas : 0
% 0.41/0.65 # Current number of archived clauses : 24
% 0.41/0.65 # Clause-clause subsumption calls (NU) : 110
% 0.41/0.65 # Rec. Clause-clause subsumption calls : 104
% 0.41/0.65 # Non-unit clause-clause subsumptions : 2
% 0.41/0.65 # Unit Clause-clause subsumption calls : 9
% 0.41/0.65 # Rewrite failures with RHS unbound : 0
% 0.41/0.65 # BW rewrite match attempts : 3
% 0.41/0.65 # BW rewrite match successes : 0
% 0.41/0.65 # Condensation attempts : 0
% 0.41/0.65 # Condensation successes : 0
% 0.41/0.65 # Termbank termtop insertions : 52588
% 0.41/0.65 # Search garbage collected termcells : 31069
% 0.41/0.65
% 0.41/0.65 # -------------------------------------------------
% 0.41/0.65 # User time : 0.033 s
% 0.41/0.65 # System time : 0.017 s
% 0.41/0.65 # Total time : 0.049 s
% 0.41/0.65 # Maximum resident set size: 18128 pages
% 0.41/0.65
% 0.41/0.65 # -------------------------------------------------
% 0.41/0.65 # User time : 0.147 s
% 0.41/0.65 # System time : 0.029 s
% 0.41/0.65 # Total time : 0.176 s
% 0.41/0.65 # Maximum resident set size: 7960 pages
% 0.41/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------