TSTP Solution File: CSR066+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR066+2 : TPTP v8.2.0. Released v3.4.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 : Mon May 20 19:13:58 EDT 2024
% Result : Theorem 0.15s 0.52s
% Output : CNFRefutation 0.15s
% 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(ax1_64,axiom,
! [X7,X8,X3,X9] :
( ( isa(X7,X8)
& relationexistsall(X3,X9,X8) )
=> isa(f_relationexistsallfn(X7,X3,X9,X8),X9) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_913,axiom,
! [X13] :
( shavingrazor_manual(X13)
=> isa(X13,c_shavingrazor_manual) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_913) ).
fof(query116,conjecture,
? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X13,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query116) ).
fof(ax1_392,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_392) ).
fof(ax1_97,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_97) ).
fof(ax1_391,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+1.ax',ax1_391) ).
fof(ax1_563,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_25972)
=> tptpcol_16_25972(X13) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_563) ).
fof(c_0_7,plain,
! [X44,X45,X46,X47] :
( ~ isa(X44,X45)
| ~ relationexistsall(X46,X47,X45)
| isa(f_relationexistsallfn(X44,X46,X47,X45),X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])])]) ).
fof(c_0_8,plain,
! [X75] :
( ~ shavingrazor_manual(X75)
| isa(X75,c_shavingrazor_manual) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_913])])]) ).
fof(c_0_9,negated_conjecture,
~ ? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X13,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X13) ) ),
inference(assume_negation,[status(cth)],[query116]) ).
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)],[ax1_392]) ).
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)],[ax1_97]) ).
fof(c_0_14,negated_conjecture,
! [X22] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptp_8_271(X22,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,plain,
! [X25] :
( ~ shavingrazor_manual(X25)
| tptp_8_271(f_relationexistsallfn(X25,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_391])])]) ).
fof(c_0_16,plain,
! [X23] :
( ~ isa(X23,c_tptpcol_16_25972)
| tptpcol_16_25972(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_563])])]) ).
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.00/0.09 % Problem : CSR066+2 : TPTP v8.2.0. Released v3.4.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 01:36:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.52 # Version: 3.1.0
% 0.15/0.52 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/0.52 # Starting new_bool_3 with 600s (2) cores
% 0.15/0.52 # Starting new_bool_1 with 600s (2) cores
% 0.15/0.52 # Starting sh5l with 300s (1) cores
% 0.15/0.52 # sh5l with pid 16516 completed with status 0
% 0.15/0.52 # Result found by sh5l
% 0.15/0.52 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/0.52 # Starting new_bool_3 with 600s (2) cores
% 0.15/0.52 # Starting new_bool_1 with 600s (2) cores
% 0.15/0.52 # Starting sh5l with 300s (1) cores
% 0.15/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.52 # Search class: FHHNM-FSLM31-MFFFFFNN
% 0.15/0.52 # partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.15/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16521 completed with status 0
% 0.15/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.52 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/0.52 # Starting new_bool_3 with 600s (2) cores
% 0.15/0.52 # Starting new_bool_1 with 600s (2) cores
% 0.15/0.52 # Starting sh5l with 300s (1) cores
% 0.15/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.52 # Search class: FHHNM-FSLM31-MFFFFFNN
% 0.15/0.52 # partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.15/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.52 # Preprocessing time : 0.004 s
% 0.15/0.52 # Presaturation interreduction done
% 0.15/0.52
% 0.15/0.52 # Proof found!
% 0.15/0.52 # SZS status Theorem
% 0.15/0.52 # SZS output start CNFRefutation
% See solution above
% 0.15/0.52 # Parsed axioms : 1132
% 0.15/0.52 # Removed by relevancy pruning/SinE : 834
% 0.15/0.52 # Initial clauses : 299
% 0.15/0.52 # Removed in clause preprocessing : 0
% 0.15/0.52 # Initial clauses in saturation : 299
% 0.15/0.52 # Processed clauses : 1530
% 0.15/0.52 # ...of these trivial : 141
% 0.15/0.52 # ...subsumed : 37
% 0.15/0.52 # ...remaining for further processing : 1352
% 0.15/0.52 # Other redundant clauses eliminated : 0
% 0.15/0.52 # Clauses deleted for lack of memory : 0
% 0.15/0.52 # Backward-subsumed : 1
% 0.15/0.52 # Backward-rewritten : 4
% 0.15/0.52 # Generated clauses : 2239
% 0.15/0.52 # ...of the previous two non-redundant : 953
% 0.15/0.52 # ...aggressively subsumed : 0
% 0.15/0.52 # Contextual simplify-reflections : 0
% 0.15/0.52 # Paramodulations : 2239
% 0.15/0.52 # Factorizations : 0
% 0.15/0.52 # NegExts : 0
% 0.15/0.52 # Equation resolutions : 0
% 0.15/0.52 # Disequality decompositions : 0
% 0.15/0.52 # Total rewrite steps : 1377
% 0.15/0.52 # ...of those cached : 977
% 0.15/0.52 # Propositional unsat checks : 0
% 0.15/0.52 # Propositional check models : 0
% 0.15/0.52 # Propositional check unsatisfiable : 0
% 0.15/0.52 # Propositional clauses : 0
% 0.15/0.52 # Propositional clauses after purity: 0
% 0.15/0.52 # Propositional unsat core size : 0
% 0.15/0.52 # Propositional preprocessing time : 0.000
% 0.15/0.52 # Propositional encoding time : 0.000
% 0.15/0.52 # Propositional solver time : 0.000
% 0.15/0.52 # Success case prop preproc time : 0.000
% 0.15/0.52 # Success case prop encoding time : 0.000
% 0.15/0.52 # Success case prop solver time : 0.000
% 0.15/0.52 # Current number of processed clauses : 1062
% 0.15/0.52 # Positive orientable unit clauses : 716
% 0.15/0.52 # Positive unorientable unit clauses: 0
% 0.15/0.52 # Negative unit clauses : 27
% 0.15/0.52 # Non-unit-clauses : 319
% 0.15/0.52 # Current number of unprocessed clauses: 7
% 0.15/0.52 # ...number of literals in the above : 10
% 0.15/0.52 # Current number of archived formulas : 0
% 0.15/0.52 # Current number of archived clauses : 290
% 0.15/0.52 # Clause-clause subsumption calls (NU) : 18522
% 0.15/0.52 # Rec. Clause-clause subsumption calls : 17289
% 0.15/0.52 # Non-unit clause-clause subsumptions : 13
% 0.15/0.52 # Unit Clause-clause subsumption calls : 15157
% 0.15/0.52 # Rewrite failures with RHS unbound : 0
% 0.15/0.52 # BW rewrite match attempts : 4
% 0.15/0.52 # BW rewrite match successes : 4
% 0.15/0.52 # Condensation attempts : 0
% 0.15/0.52 # Condensation successes : 0
% 0.15/0.52 # Termbank termtop insertions : 35728
% 0.15/0.52 # Search garbage collected termcells : 5217
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.071 s
% 0.15/0.52 # System time : 0.007 s
% 0.15/0.52 # Total time : 0.078 s
% 0.15/0.52 # Maximum resident set size: 4652 pages
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.086 s
% 0.15/0.52 # System time : 0.010 s
% 0.15/0.52 # Total time : 0.096 s
% 0.15/0.52 # Maximum resident set size: 2648 pages
% 0.15/0.52 % E---3.1 exiting
% 0.15/0.52 % E exiting
%------------------------------------------------------------------------------