%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU168+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n012.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 : Tue Jul 19 09:24:26 EDT 2022 % Result : Theorem 2.04s 0.62s % Output : CNFRefutation 2.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU168+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n012.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 : 600 % 0.12/0.33 % DateTime : Mon Jun 20 05:47:52 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 32 Number of unprocessed: 32 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 32 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 18 conjectures. % 0.12/0.37 # There are 18 start rule candidates: % 0.12/0.37 # Found 2 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 18 start rule tableaux created. % 0.12/0.37 # 30 extension rule candidate clauses % 0.12/0.37 # 2 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 2.04/0.62 # There were 3 total branch saturation attempts. % 2.04/0.62 # There were 0 of these attempts blocked. % 2.04/0.62 # There were 0 deferred branch saturation attempts. % 2.04/0.62 # There were 0 free duplicated saturations. % 2.04/0.62 # There were 3 total successful branch saturations. % 2.04/0.62 # There were 0 successful branch saturations in interreduction. % 2.04/0.62 # There were 0 successful branch saturations on the branch. % 2.04/0.62 # There were 3 successful branch saturations after the branch. % 2.04/0.62 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.04/0.62 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.04/0.62 # Begin clausification derivation % 2.04/0.62 % 2.04/0.62 # End clausification derivation % 2.04/0.62 # Begin listing active clauses obtained from FOF to CNF conversion % 2.04/0.62 cnf(i_0_10, plain, (subset(X1,X1))). % 2.04/0.62 cnf(i_0_33, plain, (in(X1,esk8_1(X1)))). % 2.04/0.62 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 2.04/0.62 cnf(i_0_12, negated_conjecture, (~are_equipotent(esk7_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk5_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_11, negated_conjecture, (~in(powerset(esk6_1(X1)),X1)|~in(esk5_1(X1),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_4, plain, (in(X1,powerset(X2))|~subset(X1,X2))). % 2.04/0.62 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))). % 2.04/0.62 cnf(i_0_8, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 2.04/0.62 cnf(i_0_5, plain, (subset(X1,X2)|~in(X1,powerset(X2)))). % 2.04/0.62 cnf(i_0_7, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))). % 2.04/0.62 cnf(i_0_14, negated_conjecture, (in(esk6_1(X1),X1)|~in(esk5_1(X1),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_15, negated_conjecture, (in(esk6_1(X1),X1)|~are_equipotent(esk7_1(X1),X1)|~in(esk5_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_24, negated_conjecture, (in(esk4_1(X1),X1)|~are_equipotent(esk7_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_23, negated_conjecture, (in(esk4_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_29, plain, (are_equipotent(X1,esk8_1(X2))|in(X1,esk8_1(X2))|~subset(X1,esk8_1(X2)))). % 2.04/0.62 cnf(i_0_31, plain, (in(esk9_2(X1,X2),esk8_1(X1))|~in(X2,esk8_1(X1)))). % 2.04/0.62 cnf(i_0_30, plain, (in(X1,esk9_2(X2,X3))|~subset(X1,X3)|~in(X3,esk8_1(X2)))). % 2.04/0.62 cnf(i_0_3, plain, (X1=powerset(X2)|~subset(esk1_2(X2,X1),X2)|~in(esk1_2(X2,X1),X1))). % 2.04/0.62 cnf(i_0_32, plain, (in(X1,esk8_1(X2))|~subset(X1,X3)|~in(X3,esk8_1(X2)))). % 2.04/0.62 cnf(i_0_13, negated_conjecture, (subset(esk7_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk5_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_28, negated_conjecture, (subset(esk7_1(X1),X1)|in(esk6_1(X1),X1)|in(esk4_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_17, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|~in(powerset(esk6_1(X1)),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_18, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|~are_equipotent(esk7_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_27, negated_conjecture, (in(esk6_1(X1),X1)|in(esk4_1(X1),X1)|~are_equipotent(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_16, negated_conjecture, (subset(esk7_1(X1),X1)|in(esk6_1(X1),X1)|~in(esk5_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_2, plain, (X1=powerset(X2)|subset(esk1_2(X2,X1),X2)|in(esk1_2(X2,X1),X1))). % 2.04/0.62 cnf(i_0_26, negated_conjecture, (in(esk6_1(X1),X1)|in(esk4_1(X1),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_25, negated_conjecture, (subset(esk7_1(X1),X1)|in(esk4_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_20, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|in(esk6_1(X1),X1)|~in(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_21, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|in(esk6_1(X1),X1)|~are_equipotent(esk7_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_19, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|subset(esk7_1(X1),X1)|~in(powerset(esk6_1(X1)),X1)|~in(esk3_0,X1))). % 2.04/0.62 cnf(i_0_22, negated_conjecture, (subset(esk5_1(X1),esk4_1(X1))|subset(esk7_1(X1),X1)|in(esk6_1(X1),X1)|~in(esk3_0,X1))). % 2.04/0.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.04/0.62 # Begin printing tableau % 2.04/0.62 # Found 7 steps % 2.04/0.62 cnf(i_0_25, negated_conjecture, (subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))|in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0))|~in(powerset(esk6_1(esk8_1(esk3_0))),esk8_1(esk3_0))|~in(esk3_0,esk8_1(esk3_0))), inference(start_rule)). % 2.04/0.62 cnf(i_0_55, plain, (~in(esk3_0,esk8_1(esk3_0))), inference(closure_rule, [i_0_33])). % 2.04/0.62 cnf(i_0_52, plain, (subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))), inference(extension_rule, [i_0_4])). % 2.04/0.62 cnf(i_0_110, plain, (in(esk7_1(esk8_1(esk3_0)),powerset(esk8_1(esk3_0)))), inference(extension_rule, [i_0_1])). % 2.04/0.62 cnf(i_0_53, plain, (in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0))), inference(etableau_closure_rule, [i_0_53, ...])). % 2.04/0.62 cnf(i_0_54, plain, (~in(powerset(esk6_1(esk8_1(esk3_0))),esk8_1(esk3_0))), inference(etableau_closure_rule, [i_0_54, ...])). % 2.04/0.62 cnf(i_0_113, plain, (~in(powerset(esk8_1(esk3_0)),esk7_1(esk8_1(esk3_0)))), inference(etableau_closure_rule, [i_0_113, ...])). % 2.04/0.62 # End printing tableau % 2.04/0.62 # SZS output end % 2.04/0.62 # Branches closed with saturation will be marked with an "s" % 2.04/0.62 # Child (4692) has found a proof. % 2.04/0.62 % 2.04/0.62 # Proof search is over... % 2.04/0.62 # Freeing feature tree %------------------------------------------------------------------------------