TSTP Solution File: COM011-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM011-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 17:21:14 EDT 2023
% Result : Unsatisfiable 3.26s 1.09s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 9 unt; 3 nHn; 23 RR)
% Number of literals : 51 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 63 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_UNITY_Oconstrains__weaken__L_0,axiom,
( c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_lessequals(X5,X2,tc_set(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_UNITY_Oconstrains__weaken__L_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_conjecture_0) ).
cnf(cls_WFair_Otransient__strengthen_0,axiom,
( c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_WFair_Otransient__strengthen_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_conjecture_1) ).
cnf(cls_WFair_OensuresI_0,axiom,
( c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_WFair_OensuresI_0) ).
cnf(cls_Set_ODiffE_1,axiom,
( c_in(X1,X2,X4)
| ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_Set_ODiffE_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_Set_OsubsetI_0) ).
cnf(cls_WFair_OleadsTo__Basis_0,axiom,
( c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_WFair_OleadsTo__Basis_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_conjecture_2) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p',cls_Set_OsubsetI_1) ).
cnf(c_0_10,axiom,
( c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_lessequals(X5,X2,tc_set(X4)) ),
cls_UNITY_Oconstrains__weaken__L_0 ).
cnf(c_0_11,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
cls_conjecture_0 ).
cnf(c_0_12,axiom,
( c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
cls_WFair_Otransient__strengthen_0 ).
cnf(c_0_13,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
cls_conjecture_1 ).
cnf(c_0_14,axiom,
( c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4)) ),
cls_WFair_OensuresI_0 ).
cnf(c_0_15,negated_conjecture,
( c_in(v_F,c_UNITY_Oconstrains(X1,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( c_in(v_F,c_WFair_Otransient(X1,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
( c_in(X1,X2,X4)
| ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4) ),
cls_Set_ODiffE_1 ).
cnf(c_0_18,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_19,axiom,
( c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
cls_WFair_OleadsTo__Basis_0 ).
cnf(c_0_20,negated_conjecture,
( c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
cls_conjecture_2 ).
cnf(c_0_22,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
cls_Set_OsubsetI_1 ).
cnf(c_0_23,plain,
( c_lessequals(c_minus(X1,X2,tc_set(X3)),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_minus(X1,X2,tc_set(X3)),X4,X3),X1,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
c_lessequals(c_minus(X1,X2,tc_set(X3)),X1,tc_set(X3)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.23 % Problem : COM011-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.24 % Command : run_E %s %d THM
% 0.24/0.45 % Computer : n003.cluster.edu
% 0.24/0.45 % Model : x86_64 x86_64
% 0.24/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.45 % Memory : 8042.1875MB
% 0.24/0.45 % OS : Linux 3.10.0-693.el7.x86_64
% 0.24/0.45 % CPULimit : 2400
% 0.24/0.45 % WCLimit : 300
% 0.24/0.45 % DateTime : Tue Oct 3 05:04:18 EDT 2023
% 0.24/0.45 % CPUTime :
% 0.43/0.70 Running first-order theorem proving
% 0.43/0.70 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ErXm4rIpzy/E---3.1_22259.p
% 3.26/1.09 # Version: 3.1pre001
% 3.26/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.26/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.26/1.09 # Starting new_bool_3 with 300s (1) cores
% 3.26/1.09 # Starting new_bool_1 with 300s (1) cores
% 3.26/1.09 # Starting sh5l with 300s (1) cores
% 3.26/1.09 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22428 completed with status 0
% 3.26/1.09 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.26/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.26/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.26/1.09 # No SInE strategy applied
% 3.26/1.09 # Search class: FGHSM-SSLM33-MFFFFFNN
% 3.26/1.09 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.26/1.09 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.26/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.26/1.09 # Starting new_bool_3 with 136s (1) cores
% 3.26/1.09 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.26/1.09 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 3.26/1.09 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22439 completed with status 0
% 3.26/1.09 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.26/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.26/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.26/1.09 # No SInE strategy applied
% 3.26/1.09 # Search class: FGHSM-SSLM33-MFFFFFNN
% 3.26/1.09 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.26/1.09 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.26/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.26/1.09 # Preprocessing time : 0.012 s
% 3.26/1.09 # Presaturation interreduction done
% 3.26/1.09
% 3.26/1.09 # Proof found!
% 3.26/1.09 # SZS status Unsatisfiable
% 3.26/1.09 # SZS output start CNFRefutation
% See solution above
% 3.26/1.09 # Parsed axioms : 1374
% 3.26/1.09 # Removed by relevancy pruning/SinE : 0
% 3.26/1.09 # Initial clauses : 1374
% 3.26/1.09 # Removed in clause preprocessing : 1
% 3.26/1.09 # Initial clauses in saturation : 1373
% 3.26/1.09 # Processed clauses : 6508
% 3.26/1.09 # ...of these trivial : 99
% 3.26/1.09 # ...subsumed : 3104
% 3.26/1.09 # ...remaining for further processing : 3305
% 3.26/1.09 # Other redundant clauses eliminated : 34
% 3.26/1.09 # Clauses deleted for lack of memory : 0
% 3.26/1.09 # Backward-subsumed : 74
% 3.26/1.09 # Backward-rewritten : 102
% 3.26/1.09 # Generated clauses : 10962
% 3.26/1.09 # ...of the previous two non-redundant : 9586
% 3.26/1.09 # ...aggressively subsumed : 0
% 3.26/1.09 # Contextual simplify-reflections : 3
% 3.26/1.09 # Paramodulations : 10894
% 3.26/1.09 # Factorizations : 4
% 3.26/1.09 # NegExts : 0
% 3.26/1.09 # Equation resolutions : 64
% 3.26/1.09 # Total rewrite steps : 2634
% 3.26/1.09 # Propositional unsat checks : 0
% 3.26/1.09 # Propositional check models : 0
% 3.26/1.09 # Propositional check unsatisfiable : 0
% 3.26/1.09 # Propositional clauses : 0
% 3.26/1.09 # Propositional clauses after purity: 0
% 3.26/1.09 # Propositional unsat core size : 0
% 3.26/1.09 # Propositional preprocessing time : 0.000
% 3.26/1.09 # Propositional encoding time : 0.000
% 3.26/1.09 # Propositional solver time : 0.000
% 3.26/1.09 # Success case prop preproc time : 0.000
% 3.26/1.09 # Success case prop encoding time : 0.000
% 3.26/1.09 # Success case prop solver time : 0.000
% 3.26/1.09 # Current number of processed clauses : 1794
% 3.26/1.09 # Positive orientable unit clauses : 275
% 3.26/1.09 # Positive unorientable unit clauses: 0
% 3.26/1.09 # Negative unit clauses : 137
% 3.26/1.09 # Non-unit-clauses : 1382
% 3.26/1.09 # Current number of unprocessed clauses: 5463
% 3.26/1.09 # ...number of literals in the above : 11759
% 3.26/1.09 # Current number of archived formulas : 0
% 3.26/1.09 # Current number of archived clauses : 1511
% 3.26/1.09 # Clause-clause subsumption calls (NU) : 1583981
% 3.26/1.09 # Rec. Clause-clause subsumption calls : 1484600
% 3.26/1.09 # Non-unit clause-clause subsumptions : 2958
% 3.26/1.09 # Unit Clause-clause subsumption calls : 35465
% 3.26/1.09 # Rewrite failures with RHS unbound : 0
% 3.26/1.09 # BW rewrite match attempts : 250
% 3.26/1.09 # BW rewrite match successes : 81
% 3.26/1.09 # Condensation attempts : 0
% 3.26/1.09 # Condensation successes : 0
% 3.26/1.09 # Termbank termtop insertions : 179438
% 3.26/1.09
% 3.26/1.09 # -------------------------------------------------
% 3.26/1.09 # User time : 0.350 s
% 3.26/1.09 # System time : 0.013 s
% 3.26/1.09 # Total time : 0.363 s
% 3.26/1.09 # Maximum resident set size: 3748 pages
% 3.26/1.09
% 3.26/1.09 # -------------------------------------------------
% 3.26/1.09 # User time : 1.730 s
% 3.26/1.09 # System time : 0.057 s
% 3.26/1.09 # Total time : 1.787 s
% 3.26/1.09 # Maximum resident set size: 2412 pages
% 3.26/1.09 % E---3.1 exiting
% 3.26/1.09 % E---3.1 exiting
%------------------------------------------------------------------------------