TSTP Solution File: SWV221+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV221+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:56:23 EDT 2023
% Result : Theorem 0.15s 0.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 217 ( 44 equ)
% Maximal formula atoms : 51 ( 13 avg)
% Number of connectives : 261 ( 60 ~; 51 |; 113 &)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn; 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0401,conjecture,
( ( leq(n0,pv5)
& leq(n0,pv57)
& leq(pv5,n998)
& leq(pv57,n5)
& leq(pv58,n5)
& gt(pv58,pv57)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X28,X29] :
( ( leq(n0,X28)
& leq(n0,X29)
& leq(X28,n5)
& leq(X29,n5) )
=> ( ( X28 = pv57
& gt(pv58,X29) )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X5,X11] :
( ( leq(n0,X5)
& leq(n0,X11)
& leq(X5,n5)
& leq(X11,n5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,pred(pv57)) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n5) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) ) )
=> ! [X19] :
( ( leq(n0,X19)
& leq(X19,pred(pv57)) )
=> ! [X15] :
( ( leq(n0,X15)
& leq(X15,n5) )
=> ( ( ~ ( pv57 = X15
& X15 = X19 )
& pv57 != X19 )
=> a_select3(id_ds1_filter,X19,X15) = a_select3(id_ds1_filter,X15,X19) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PGWC7sW6fb/E---3.1_16037.p',quaternion_ds1_symm_0401) ).
fof(c_0_1,plain,
( epred1_0
<=> ( leq(n0,pv5)
& leq(n0,pv57)
& leq(pv5,n998)
& leq(pv57,n5)
& leq(pv58,n5)
& gt(pv58,pv57)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X28,X29] :
( ( leq(n0,X28)
& leq(n0,X29)
& leq(X28,n5)
& leq(X29,n5) )
=> ( ( X28 = pv57
& gt(pv58,X29) )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X5,X11] :
( ( leq(n0,X5)
& leq(n0,X11)
& leq(X5,n5)
& leq(X11,n5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,pred(pv57)) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n5) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( leq(n0,pv5)
& leq(n0,pv57)
& leq(pv5,n998)
& leq(pv57,n5)
& leq(pv58,n5)
& gt(pv58,pv57)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X28,X29] :
( ( leq(n0,X28)
& leq(n0,X29)
& leq(X28,n5)
& leq(X29,n5) )
=> ( ( X28 = pv57
& gt(pv58,X29) )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X5,X11] :
( ( leq(n0,X5)
& leq(n0,X11)
& leq(X5,n5)
& leq(X11,n5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,pred(pv57)) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n5) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( ( leq(n0,X19)
& leq(X19,pred(pv57)) )
=> ! [X15] :
( ( leq(n0,X15)
& leq(X15,n5) )
=> ( ( ~ ( pv57 = X15
& X15 = X19 )
& pv57 != X19 )
=> a_select3(id_ds1_filter,X19,X15) = a_select3(id_ds1_filter,X15,X19) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0401]),c_0_1]) ).
fof(c_0_4,plain,
! [X75,X76,X77,X78,X79,X80,X81,X82,X83,X84,X85,X86] :
( ( leq(n0,pv5)
| ~ epred1_0 )
& ( leq(n0,pv57)
| ~ epred1_0 )
& ( leq(pv5,n998)
| ~ epred1_0 )
& ( leq(pv57,n5)
| ~ epred1_0 )
& ( leq(pv58,n5)
| ~ epred1_0 )
& ( gt(pv58,pv57)
| ~ epred1_0 )
& ( ~ leq(n0,X75)
| ~ leq(n0,X76)
| ~ leq(X75,n5)
| ~ leq(X76,n5)
| a_select3(q_ds1_filter,X75,X76) = a_select3(q_ds1_filter,X76,X75)
| ~ epred1_0 )
& ( ~ leq(n0,X77)
| ~ leq(n0,X78)
| ~ leq(X77,n2)
| ~ leq(X78,n2)
| a_select3(r_ds1_filter,X77,X78) = a_select3(r_ds1_filter,X78,X77)
| ~ epred1_0 )
& ( ~ leq(n0,X79)
| ~ leq(n0,X80)
| ~ leq(X79,n5)
| ~ leq(X80,n5)
| a_select3(pminus_ds1_filter,X79,X80) = a_select3(pminus_ds1_filter,X80,X79)
| ~ epred1_0 )
& ( ~ leq(n0,X81)
| ~ leq(n0,X82)
| ~ leq(X81,n5)
| ~ leq(X82,n5)
| X81 != pv57
| ~ gt(pv58,X82)
| a_select3(id_ds1_filter,X81,X82) = a_select3(id_ds1_filter,X82,X81)
| ~ epred1_0 )
& ( ~ leq(n0,X83)
| ~ leq(n0,X84)
| ~ leq(X83,n5)
| ~ leq(X84,n5)
| ~ gt(pv57,X83)
| a_select3(id_ds1_filter,X83,X84) = a_select3(id_ds1_filter,X84,X83)
| ~ epred1_0 )
& ( ~ leq(n0,X85)
| ~ leq(X85,pred(pv57))
| ~ leq(n0,X86)
| ~ leq(X86,n5)
| a_select3(id_ds1_filter,X85,X86) = a_select3(id_ds1_filter,X86,X85)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,pred(pv57))
& leq(n0,esk2_0)
& leq(esk2_0,n5)
& ( pv57 != esk2_0
| esk2_0 != esk1_0 )
& pv57 != esk1_0
& a_select3(id_ds1_filter,esk1_0,esk2_0) != a_select3(id_ds1_filter,esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1)
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv57))
| ~ leq(n0,X2)
| ~ leq(X2,n5)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1)
| ~ leq(X1,pred(pv57))
| ~ leq(X2,n5)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_9,negated_conjecture,
leq(esk2_0,n5),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( a_select3(id_ds1_filter,X1,esk2_0) = a_select3(id_ds1_filter,esk2_0,X1)
| ~ leq(X1,pred(pv57))
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
leq(esk1_0,pred(pv57)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
a_select3(id_ds1_filter,esk1_0,esk2_0) != a_select3(id_ds1_filter,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV221+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:08:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.PGWC7sW6fb/E---3.1_16037.p
% 0.15/0.52 # Version: 3.1pre001
% 0.15/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.52 # Starting sh5l with 300s (1) cores
% 0.15/0.52 # new_bool_3 with pid 16115 completed with status 0
% 0.15/0.52 # Result found by new_bool_3
% 0.15/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.52 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.52 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.52 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 16118 completed with status 0
% 0.15/0.52 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.52 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.52 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.52 # Preprocessing time : 0.003 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 : 92
% 0.15/0.52 # Removed by relevancy pruning/SinE : 26
% 0.15/0.52 # Initial clauses : 88
% 0.15/0.52 # Removed in clause preprocessing : 0
% 0.15/0.52 # Initial clauses in saturation : 88
% 0.15/0.52 # Processed clauses : 1134
% 0.15/0.52 # ...of these trivial : 145
% 0.15/0.52 # ...subsumed : 132
% 0.15/0.52 # ...remaining for further processing : 857
% 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 : 10
% 0.15/0.52 # Backward-rewritten : 1
% 0.15/0.52 # Generated clauses : 6128
% 0.15/0.52 # ...of the previous two non-redundant : 3416
% 0.15/0.52 # ...aggressively subsumed : 0
% 0.15/0.52 # Contextual simplify-reflections : 0
% 0.15/0.52 # Paramodulations : 6106
% 0.15/0.52 # Factorizations : 21
% 0.15/0.52 # NegExts : 0
% 0.15/0.52 # Equation resolutions : 1
% 0.15/0.52 # Total rewrite steps : 5002
% 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 : 758
% 0.15/0.52 # Positive orientable unit clauses : 429
% 0.15/0.52 # Positive unorientable unit clauses: 0
% 0.15/0.52 # Negative unit clauses : 3
% 0.15/0.52 # Non-unit-clauses : 326
% 0.15/0.52 # Current number of unprocessed clauses: 2451
% 0.15/0.52 # ...number of literals in the above : 6308
% 0.15/0.52 # Current number of archived formulas : 0
% 0.15/0.52 # Current number of archived clauses : 99
% 0.15/0.52 # Clause-clause subsumption calls (NU) : 11260
% 0.15/0.52 # Rec. Clause-clause subsumption calls : 9388
% 0.15/0.52 # Non-unit clause-clause subsumptions : 133
% 0.15/0.52 # Unit Clause-clause subsumption calls : 1917
% 0.15/0.52 # Rewrite failures with RHS unbound : 0
% 0.15/0.52 # BW rewrite match attempts : 334
% 0.15/0.52 # BW rewrite match successes : 10
% 0.15/0.52 # Condensation attempts : 0
% 0.15/0.52 # Condensation successes : 0
% 0.15/0.52 # Termbank termtop insertions : 61656
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.082 s
% 0.15/0.52 # System time : 0.002 s
% 0.15/0.52 # Total time : 0.084 s
% 0.15/0.52 # Maximum resident set size: 2072 pages
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.083 s
% 0.15/0.52 # System time : 0.005 s
% 0.15/0.52 # Total time : 0.088 s
% 0.15/0.52 # Maximum resident set size: 1808 pages
% 0.15/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------