TSTP Solution File: CSR038+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR038+1 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:25 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 11 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-4 aty)
% Number of variables : 23 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query38,conjecture,
? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query38) ).
fof(just41,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_7738)
=> tptpcol_16_7738(X13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just41) ).
fof(just6,axiom,
! [X1] :
( isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
=> tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just6) ).
fof(just8,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).
fof(just1,axiom,
! [X1,X2,X3,X4] :
( ( isa(X1,X2)
& relationexistsall(X3,X4,X2) )
=> isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(just7,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).
fof(c_0_6,negated_conjecture,
~ ? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X13) ) ),
inference(assume_negation,[status(cth)],[query38]) ).
fof(c_0_7,negated_conjecture,
! [X22] :
( mtvisible(c_knowledgefragmentd3mt)
& ( ~ tptp_8_968(X22,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X23] :
( ~ isa(X23,c_tptpcol_16_7738)
| tptpcol_16_7738(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just41])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( tptpcol_16_7738(X1)
| ~ isa(X1,c_tptpcol_16_7738) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X25] :
( ~ isa(X25,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| tptp_8_968(f_relationexistsallfn(X25,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just6])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ isa(X1,c_tptpcol_16_7738) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)
| ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[just8]) ).
fof(c_0_15,plain,
! [X32,X33,X34,X35] :
( ~ isa(X32,X33)
| ~ relationexistsall(X34,X35,X33)
| isa(f_relationexistsallfn(X32,X34,X35,X33),X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just1])])]) ).
cnf(c_0_16,negated_conjecture,
~ isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( isa(f_relationexistsallfn(X1,X3,X4,X2),X4)
| ~ isa(X1,X2)
| ~ relationexistsall(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[just7]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR038+1 : TPTP v8.2.0. Released v3.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 02:00:38 EDT 2024
% 0.14/0.35 % 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.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 15045 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHHNM-FFMM33-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 15051 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHHNM-FFMM33-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.003 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 73
% 0.21/0.51 # Removed by relevancy pruning/SinE : 16
% 0.21/0.51 # Initial clauses : 58
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 58
% 0.21/0.51 # Processed clauses : 133
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 8
% 0.21/0.51 # ...remaining for further processing : 124
% 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 : 0
% 0.21/0.51 # Generated clauses : 54
% 0.21/0.51 # ...of the previous two non-redundant : 26
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 54
% 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 : 29
% 0.21/0.51 # ...of those cached : 18
% 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 : 71
% 0.21/0.51 # Positive orientable unit clauses : 30
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 40
% 0.21/0.51 # Current number of unprocessed clauses: 4
% 0.21/0.51 # ...number of literals in the above : 9
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 53
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 332
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 319
% 0.21/0.51 # Non-unit clause-clause subsumptions : 8
% 0.21/0.51 # Unit Clause-clause subsumption calls : 34
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4069
% 0.21/0.51 # Search garbage collected termcells : 569
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.010 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.013 s
% 0.21/0.51 # Maximum resident set size: 1920 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1772 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------