%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.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 : n009.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 01:04:06 EDT 2022 % Result : Theorem 0.15s 0.40s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.35 % Computer : n009.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Sun Jul 10 07:45:37 EDT 2022 % 0.15/0.35 % CPUTime : % 0.15/0.38 # No SInE strategy applied % 0.15/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.38 # % 0.15/0.38 # Presaturation interreduction done % 0.15/0.38 # Number of axioms: 16 Number of unprocessed: 16 % 0.15/0.38 # Tableaux proof search. % 0.15/0.38 # APR header successfully linked. % 0.15/0.38 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 16 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 5 conjectures. % 0.15/0.39 # There are 5 start rule candidates: % 0.15/0.39 # Found 8 unit axioms. % 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.39 # 5 start rule tableaux created. % 0.15/0.39 # 8 extension rule candidate clauses % 0.15/0.39 # 8 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 5 % 0.15/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.15/0.39 # We now have 13 tableaux to operate on % 0.15/0.40 # There were 2 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 2 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 2 successful branch saturations after the branch. % 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk5_0,cartesian_product2(esk6_0,esk7_0)))). % 0.15/0.40 cnf(i_0_14, negated_conjecture, (subset(esk8_0,cartesian_product2(esk9_0,esk10_0)))). % 0.15/0.40 cnf(i_0_5, plain, (empty(esk1_0))). % 0.15/0.40 cnf(i_0_7, plain, (subset(X1,X1))). % 0.15/0.40 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.15/0.40 cnf(i_0_11, negated_conjecture, (esk8_0!=esk5_0)). % 0.15/0.40 cnf(i_0_6, plain, (~empty(esk2_0))). % 0.15/0.40 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 0.15/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.40 cnf(i_0_17, plain, (X1=X2|~in(esk11_2(X1,X2),X2)|~in(esk11_2(X1,X2),X1))). % 0.15/0.40 cnf(i_0_10, plain, (in(esk3_4(X1,X2,X3,X4),X2)|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1))). % 0.15/0.40 cnf(i_0_12, negated_conjecture, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0))). % 0.15/0.40 cnf(i_0_13, negated_conjecture, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0))). % 0.15/0.40 cnf(i_0_9, plain, (in(esk4_4(X1,X2,X3,X4),X3)|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1))). % 0.15/0.40 cnf(i_0_16, plain, (X1=X2|in(esk11_2(X1,X2),X1)|in(esk11_2(X1,X2),X2))). % 0.15/0.40 cnf(i_0_8, plain, (unordered_pair(singleton(esk3_4(X1,X2,X3,X4)),unordered_pair(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)))=X4|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1))). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 5 steps % 0.15/0.40 cnf(i_0_11, negated_conjecture, (esk8_0!=esk5_0), inference(start_rule)). % 0.15/0.40 cnf(i_0_22, plain, (esk8_0!=esk5_0), inference(extension_rule, [i_0_16])). % 0.15/0.40 cnf(i_0_123, plain, (in(esk11_2(esk8_0,esk5_0),esk8_0)), inference(extension_rule, [i_0_1])). % 0.15/0.40 cnf(i_0_124, plain, (in(esk11_2(esk8_0,esk5_0),esk5_0)), inference(etableau_closure_rule, [i_0_124, ...])). % 0.15/0.40 cnf(i_0_126, plain, (~in(esk8_0,esk11_2(esk8_0,esk5_0))), inference(etableau_closure_rule, [i_0_126, ...])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # Creating equality axioms % 0.15/0.40 # Ran out of tableaux, making start rules for all clauses % 0.15/0.40 # Child (3632) has found a proof. % 0.15/0.40 % 0.15/0.40 # Proof search is over... % 0.15/0.40 # Freeing feature tree %------------------------------------------------------------------------------