TSTP Solution File: CSR038+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR038+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : 600s
% DateTime : Fri Jul 15 03:01:38 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 12 |; 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 : 25 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query88,conjecture,
? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X13) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query88) ).
fof(ax1_244,axiom,
! [X7] :
( isa(X7,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
=> tptp_8_968(f_relationexistsallfn(X7,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_244) ).
fof(ax1_673,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_7738)
=> tptpcol_16_7738(X13) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_673) ).
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/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_134,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_134) ).
fof(ax1_245,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_245) ).
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)],[query88]) ).
fof(c_0_7,negated_conjecture,
! [X14] :
( mtvisible(c_knowledgefragmentd3mt)
& ( ~ tptp_8_968(X14,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X14) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X8] :
( ~ isa(X8,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| tptp_8_968(f_relationexistsallfn(X8,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_244])]) ).
fof(c_0_9,plain,
! [X14] :
( ~ isa(X14,c_tptpcol_16_7738)
| tptpcol_16_7738(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_673])]) ).
fof(c_0_10,plain,
! [X10,X11,X12,X13] :
( ~ isa(X10,X11)
| ~ relationexistsall(X12,X13,X11)
| isa(f_relationexistsallfn(X10,X12,X13,X11),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])]) ).
cnf(c_0_11,negated_conjecture,
( ~ tptpcol_16_7738(X1)
| ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax1_134]) ).
cnf(c_0_14,plain,
( tptpcol_16_7738(X1)
| ~ isa(X1,c_tptpcol_16_7738) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ relationexistsall(X2,X3,X4)
| ~ isa(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( tptpcol_16_7738(f_relationexistsallfn(X1,X2,c_tptpcol_16_7738,X3))
| ~ relationexistsall(X2,c_tptpcol_16_7738,X3)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,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)],[ax1_245]) ).
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_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR038+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 05:41:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.27/1.46 # Preprocessing time : 0.050 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 20
% 0.27/1.46 # Proof object clause steps : 9
% 0.27/1.46 # Proof object formula steps : 11
% 0.27/1.46 # Proof object conjectures : 6
% 0.27/1.46 # Proof object clause conjectures : 3
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 6
% 0.27/1.46 # Proof object initial formulas used : 6
% 0.27/1.46 # Proof object generating inferences : 3
% 0.27/1.46 # Proof object simplifying inferences : 5
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 1132
% 0.27/1.46 # Removed by relevancy pruning/SinE : 0
% 0.27/1.46 # Initial clauses : 1133
% 0.27/1.46 # Removed in clause preprocessing : 0
% 0.27/1.46 # Initial clauses in saturation : 1133
% 0.27/1.46 # Processed clauses : 2579
% 0.27/1.46 # ...of these trivial : 347
% 0.27/1.46 # ...subsumed : 86
% 0.27/1.46 # ...remaining for further processing : 2146
% 0.27/1.46 # Other redundant clauses eliminated : 0
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 1
% 0.27/1.46 # Backward-rewritten : 4
% 0.27/1.46 # Generated clauses : 3862
% 0.27/1.46 # ...of the previous two non-trivial : 3566
% 0.27/1.46 # Contextual simplify-reflections : 0
% 0.27/1.46 # Paramodulations : 3862
% 0.27/1.46 # Factorizations : 0
% 0.27/1.46 # Equation resolutions : 0
% 0.27/1.46 # Current number of processed clauses : 2141
% 0.27/1.46 # Positive orientable unit clauses : 780
% 0.27/1.46 # Positive unorientable unit clauses: 0
% 0.27/1.46 # Negative unit clauses : 167
% 0.27/1.46 # Non-unit-clauses : 1194
% 0.27/1.46 # Current number of unprocessed clauses: 2120
% 0.27/1.46 # ...number of literals in the above : 4866
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 5
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 202593
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 188634
% 0.27/1.46 # Non-unit clause-clause subsumptions : 87
% 0.27/1.46 # Unit Clause-clause subsumption calls : 147965
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 7
% 0.27/1.46 # BW rewrite match successes : 4
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 75471
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.182 s
% 0.27/1.46 # System time : 0.009 s
% 0.27/1.46 # Total time : 0.191 s
% 0.27/1.46 # Maximum resident set size: 13772 pages
%------------------------------------------------------------------------------