TSTP Solution File: SYN075+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SYN075+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 Jun 24 19:09:16 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 57 ( 38 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 59 ( 21 ~; 27 |; 6 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 2 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel52,conjecture,
? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.zUWp9CD4FC/E---3.1_23733.p',pel52) ).
fof(pel52_1,axiom,
? [X1,X2] :
! [X3,X4] :
( big_f(X3,X4)
<=> ( X3 = X1
& X4 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.zUWp9CD4FC/E---3.1_23733.p',pel52_1) ).
fof(c_0_2,negated_conjecture,
~ ? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
inference(assume_negation,[status(cth)],[pel52]) ).
fof(c_0_3,negated_conjecture,
! [X5,X7,X10,X11] :
( ( ~ big_f(esk2_2(X5,X7),esk1_1(X5))
| esk2_2(X5,X7) != X7
| esk1_1(X5) != X5 )
& ( big_f(esk2_2(X5,X7),esk1_1(X5))
| esk2_2(X5,X7) = X7
| esk1_1(X5) != X5 )
& ( ~ big_f(X10,esk1_1(X5))
| X10 = esk3_1(X5)
| esk1_1(X5) = X5 )
& ( X11 != esk3_1(X5)
| big_f(X11,esk1_1(X5))
| esk1_1(X5) = X5 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
fof(c_0_4,plain,
! [X14,X15] :
( ( X14 = esk4_0
| ~ big_f(X14,X15) )
& ( X15 = esk5_0
| ~ big_f(X14,X15) )
& ( X14 != esk4_0
| X15 != esk5_0
| big_f(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel52_1])])])])]) ).
cnf(c_0_5,negated_conjecture,
( big_f(X1,esk1_1(X2))
| esk1_1(X2) = X2
| X1 != esk3_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = esk5_0
| ~ big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk1_1(X1) = X1
| big_f(esk3_1(X1),esk1_1(X1)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = esk4_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( big_f(esk2_2(X1,X2),esk1_1(X1))
| esk2_2(X1,X2) = X2
| esk1_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( esk1_1(X1) = esk5_0
| esk1_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( esk2_2(X1,X2) = esk4_0
| esk2_2(X1,X2) = X2
| esk1_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk1_1(esk5_0) = esk5_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
( esk2_2(esk5_0,X1) = esk4_0
| esk2_2(esk5_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( big_f(X1,X2)
| X1 != esk4_0
| X2 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_f(esk2_2(X1,X2),esk1_1(X1))
| esk2_2(X1,X2) != X2
| esk1_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
esk2_2(esk5_0,esk4_0) = esk4_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_13])]) ).
cnf(c_0_17,plain,
big_f(esk4_0,esk5_0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_12]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN075+1 : TPTP v8.2.0. Released v2.0.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 23:17:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/tmp/tmp.zUWp9CD4FC/E---3.1_23733.p
% 0.21/0.52 # Version: 3.2.0
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 23812 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 23817 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 2
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 7
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 7
% 0.21/0.52 # Processed clauses : 51
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 14
% 0.21/0.52 # ...remaining for further processing : 35
% 0.21/0.52 # Other redundant clauses eliminated : 12
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 2
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 93
% 0.21/0.52 # ...of the previous two non-redundant : 56
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 3
% 0.21/0.52 # Paramodulations : 78
% 0.21/0.52 # Factorizations : 4
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 12
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 41
% 0.21/0.52 # ...of those cached : 39
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 24
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 21
% 0.21/0.52 # Current number of unprocessed clauses: 19
% 0.21/0.52 # ...number of literals in the above : 60
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 9
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 60
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 52
% 0.21/0.52 # Non-unit clause-clause subsumptions : 19
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 1420
% 0.21/0.52 # Search garbage collected termcells : 209
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.005 s
% 0.21/0.52 # System time : 0.001 s
% 0.21/0.52 # Total time : 0.006 s
% 0.21/0.52 # Maximum resident set size: 1756 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1672 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------