TSTP Solution File: SYN077+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN077+1 : TPTP v8.1.2. Released v2.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:29:12 EDT 2023
% Result : Timeout 408.18s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 78 ( 6 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 100 ( 45 ~; 41 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn; 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel54,conjecture,
~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.AJ9ZhDD344/E---3.1_13105.p',pel54) ).
fof(pel54_1,axiom,
! [X1] :
? [X2] :
! [X3] :
( big_f(X3,X2)
<=> X3 = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.AJ9ZhDD344/E---3.1_13105.p',pel54_1) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[pel54]) ).
fof(c_0_3,negated_conjecture,
! [X7,X8,X10,X12] :
( ( big_f(esk2_2(X7,X8),X8)
| ~ big_f(X7,X8)
| ~ big_f(X7,esk1_0) )
& ( ~ big_f(X10,X8)
| ~ big_f(X10,esk2_2(X7,X8))
| ~ big_f(X7,X8)
| ~ big_f(X7,esk1_0) )
& ( big_f(X7,esk3_1(X7))
| big_f(X7,esk1_0) )
& ( big_f(esk4_2(X7,X12),esk3_1(X7))
| ~ big_f(X12,esk3_1(X7))
| big_f(X7,esk1_0) )
& ( big_f(esk4_2(X7,X12),X12)
| ~ big_f(X12,esk3_1(X7))
| big_f(X7,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
fof(c_0_4,plain,
! [X14,X16,X17] :
( ( ~ big_f(X16,esk5_1(X14))
| X16 = X14 )
& ( X17 != X14
| big_f(X17,esk5_1(X14)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pel54_1])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X1,esk2_2(X3,X2))
| ~ big_f(X3,X2)
| ~ big_f(X3,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( big_f(esk4_2(X1,X2),X2)
| big_f(X1,esk1_0)
| ~ big_f(X2,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ big_f(X1,esk5_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( big_f(esk2_2(X1,X2),X2)
| ~ big_f(X1,X2)
| ~ big_f(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk4_2(X1,esk2_2(X2,X3)),X3)
| ~ big_f(esk2_2(X2,X3),esk3_1(X1))
| ~ big_f(X2,esk1_0)
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( big_f(esk4_2(X1,X2),esk3_1(X1))
| big_f(X1,esk1_0)
| ~ big_f(X2,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( esk2_2(X1,esk5_1(X2)) = X2
| ~ big_f(X1,esk5_1(X2))
| ~ big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( big_f(X1,esk5_1(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(X2,esk3_1(X1))
| ~ big_f(X2,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_f(X1,esk5_1(X2))
| ~ big_f(X3,esk5_1(X2))
| ~ big_f(X1,esk1_0)
| ~ big_f(X3,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
big_f(X1,esk5_1(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk4_2(X1,X2),esk1_0)
| ~ big_f(X2,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_f(X1,esk5_1(X2))
| ~ big_f(X2,esk1_0)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk1_0,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( big_f(X1,esk3_1(X1))
| big_f(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ big_f(X1,esk1_0)
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
big_f(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN077+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 2400
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon Oct 2 18:43:19 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.12/0.37 Running first-order model finding
% 0.12/0.37 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/tmp/tmp.AJ9ZhDD344/E---3.1_13105.p
% 408.18/300.12 # Version: 3.1pre001
% 408.18/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.18/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.18/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.12 # Starting new_bool_1 with 300s (1) cores
% 408.18/300.12 # Starting sh5l with 300s (1) cores
% 408.18/300.12 # new_bool_3 with pid 13281 completed with status 0
% 408.18/300.12 # Result found by new_bool_3
% 408.18/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.18/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.18/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.18/300.12 # Search class: FGHSF-FFSF21-SFFFFFNN
% 408.18/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.18/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.18/300.12 # SAT001_MinMin_p005000_rr_RG with pid 13284 completed with status 0
% 408.18/300.12 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.18/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.18/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.18/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.18/300.12 # Search class: FGHSF-FFSF21-SFFFFFNN
% 408.18/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.18/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.18/300.12 # Preprocessing time : 0.001 s
% 408.18/300.12 # Presaturation interreduction done
% 408.18/300.12
% 408.18/300.12 # Proof found!
% 408.18/300.12 # SZS status Theorem
% 408.18/300.12 # SZS output start CNFRefutation
% See solution above
% 408.18/300.12 # Parsed axioms : 2
% 408.18/300.12 # Removed by relevancy pruning/SinE : 0
% 408.18/300.12 # Initial clauses : 7
% 408.18/300.12 # Removed in clause preprocessing : 0
% 408.18/300.12 # Initial clauses in saturation : 7
% 408.18/300.12 # Processed clauses : 44
% 408.18/300.12 # ...of these trivial : 0
% 408.18/300.12 # ...subsumed : 3
% 408.18/300.12 # ...remaining for further processing : 41
% 408.18/300.12 # Other redundant clauses eliminated : 1
% 408.18/300.12 # Clauses deleted for lack of memory : 0
% 408.18/300.12 # Backward-subsumed : 2
% 408.18/300.12 # Backward-rewritten : 0
% 408.18/300.12 # Generated clauses : 42
% 408.18/300.12 # ...of the previous two non-redundant : 38
% 408.18/300.12 # ...aggressively subsumed : 0
% 408.18/300.12 # Contextual simplify-reflections : 1
% 408.18/300.12 # Paramodulations : 41
% 408.18/300.12 # Factorizations : 0
% 408.18/300.12 # NegExts : 0
% 408.18/300.12 # Equation resolutions : 1
% 408.18/300.12 # Total rewrite steps : 3
% 408.18/300.12 # Propositional unsat checks : 0
% 408.18/300.12 # Propositional check models : 0
% 408.18/300.12 # Propositional check unsatisfiable : 0
% 408.18/300.12 # Propositional clauses : 0
% 408.18/300.12 # Propositional clauses after purity: 0
% 408.18/300.12 # Propositional unsat core size : 0
% 408.18/300.12 # Propositional preprocessing time : 0.000
% 408.18/300.12 # Propositional encoding time : 0.000
% 408.18/300.12 # Propositional solver time : 0.000
% 408.18/300.12 # Success case prop preproc time : 0.000
% 408.18/300.12 # Success case prop encoding time : 0.000
% 408.18/300.12 # Success case prop solver time : 0.000
% 408.18/300.12 # Current number of processed clauses : 31
% 408.18/300.12 # Positive orientable unit clauses : 2
% 408.18/300.12 # Positive unorientable unit clauses: 0
% 408.18/300.12 # Negative unit clauses : 0
% 408.18/300.12 # Non-unit-clauses : 29
% 408.18/300.12 # Current number of unprocessed clauses: 8
% 408.18/300.12 # ...number of literals in the above : 25
% 408.18/300.12 # Current number of archived formulas : 0
% 408.18/300.12 # Current number of archived clauses : 9
% 408.18/300.12 # Clause-clause subsumption calls (NU) : 241
% 408.18/300.12 # Rec. Clause-clause subsumption calls : 121
% 408.18/300.12 # Non-unit clause-clause subsumptions : 6
% 408.18/300.12 # Unit Clause-clause subsumption calls : 0
% 408.18/300.12 # Rewrite failures with RHS unbound : 0
% 408.18/300.12 # BW rewrite match attempts : 2
% 408.18/300.12 # BW rewrite match successes : 0
% 408.18/300.12 # Condensation attempts : 0
% 408.18/300.12 # Condensation successes : 0
% 408.18/300.12 # Termbank termtop insertions : 1524
% 408.18/300.12
% 408.18/300.12 # -------------------------------------------------
% 408.18/300.12 # User time : 0.004 s
% 408.18/300.12 # System time : 0.000 s
% 408.18/300.12 # Total time : 0.004 s
% 408.18/300.12 # Maximum resident set size: 1764 pages
% 408.18/300.12
% 408.18/300.12 # -------------------------------------------------
% 408.18/300.12 # User time : 0.004 s
% 408.18/300.12 # System time : 0.002 s
% 408.18/300.12 # Total time : 0.006 s
% 408.18/300.12 # Maximum resident set size: 1668 pages
% 408.18/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------