%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU145+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:09 EDT 2022 % Result : Theorem 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n012.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun Jun 19 07:59:23 EDT 2022 % 0.14/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.20/0.38 # and selection function SelectCQIPrecWNTNp. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 18 Number of unprocessed: 18 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 18 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 3 conjectures. % 0.20/0.40 # There are 3 start rule candidates: % 0.20/0.40 # Found 5 unit axioms. % 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.40 # 3 start rule tableaux created. % 0.20/0.40 # 13 extension rule candidate clauses % 0.20/0.40 # 5 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.41 # There were 2 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 2 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 2 successful branch saturations after the branch. % 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_19, negated_conjecture, (subset(esk4_0,esk5_0))). % 0.20/0.41 cnf(i_0_20, plain, (subset(X1,X1))). % 0.20/0.41 cnf(i_0_4, plain, (in(X1,singleton(X1)))). % 0.20/0.41 cnf(i_0_18, negated_conjecture, (~in(esk6_0,esk4_0))). % 0.20/0.41 cnf(i_0_17, negated_conjecture, (~subset(esk4_0,set_difference(esk5_0,singleton(esk6_0))))). % 0.20/0.41 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.41 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))). % 0.20/0.41 cnf(i_0_13, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.20/0.41 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.20/0.41 cnf(i_0_8, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.20/0.41 cnf(i_0_7, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))). % 0.20/0.41 cnf(i_0_14, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.20/0.41 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.20/0.41 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.20/0.41 cnf(i_0_12, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.20/0.41 cnf(i_0_9, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))). % 0.20/0.41 cnf(i_0_10, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))). % 0.20/0.41 cnf(i_0_11, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 6 steps % 0.20/0.41 cnf(i_0_19, negated_conjecture, (subset(esk4_0,esk5_0)), inference(start_rule)). % 0.20/0.41 cnf(i_0_29, plain, (subset(esk4_0,esk5_0)), inference(extension_rule, [i_0_8])). % 0.20/0.41 cnf(i_0_106, plain, (in(esk6_0,esk5_0)), inference(extension_rule, [i_0_8])). % 0.20/0.41 cnf(i_0_140, plain, (in(esk6_0,esk4_0)), inference(closure_rule, [i_0_18])). % 0.20/0.41 cnf(i_0_108, plain, (~in(esk6_0,esk4_0)), inference(etableau_closure_rule, [i_0_108, ...])). % 0.20/0.41 cnf(i_0_141, plain, (~subset(esk5_0,esk4_0)), inference(etableau_closure_rule, [i_0_141, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.20/0.41 # We now have 10 tableaux to operate on % 0.20/0.41 # Found closed tableau during pool population. % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------