%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG046+1 : TPTP v8.1.0. Released 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 : n018.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 : Mon Jul 18 20:27:11 EDT 2022 % Result : Theorem 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.11 % Problem : RNG046+1 : TPTP v8.1.0. Released v4.0.0. % 0.12/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 : n018.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 May 30 18:17:27 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e % 0.12/0.36 # and selection function SelectLargestNegLit. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 31 Number of unprocessed: 31 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # 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 # 31 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 26 extension rule candidate clauses % 0.12/0.37 # 5 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.42 # There were 5 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 5 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 5 successful branch saturations after the branch. % 0.19/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.19/0.42 cnf(i_0_11, plain, (aScalar0(sz0z00))). % 0.19/0.42 cnf(i_0_33, hypothesis, (aScalar0(xx))). % 0.19/0.42 cnf(i_0_32, hypothesis, (aScalar0(xy))). % 0.19/0.42 cnf(i_0_15, plain, (smndt0(sz0z00)=sz0z00|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_3, plain, (szszuzczcdt0(X1)!=sz00|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_4, plain, (aNaturalNumber0(szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_14, plain, (aScalar0(smndt0(X1))|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_16, plain, (smndt0(smndt0(X1))=X1|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_6, plain, (X1=sz00|aNaturalNumber0(esk1_1(X1))|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_20, plain, (sdtasdt0(X1,sz0z00)=sz0z00|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_19, plain, (sdtasdt0(sz0z00,X1)=sz0z00|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_5, plain, (X1=sz00|szszuzczcdt0(esk1_1(X1))=X1|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_22, plain, (sdtpldt0(X1,sz0z00)=X1|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_21, plain, (sdtpldt0(sz0z00,X1)=X1|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_18, plain, (sdtpldt0(X1,smndt0(X1))=sz0z00|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_17, plain, (sdtpldt0(smndt0(X1),X1)=sz0z00|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_9, plain, (iLess0(X1,szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_7, plain, (X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.19/0.42 cnf(i_0_12, plain, (aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_13, plain, (aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_34, negated_conjecture, (sdtasdt0(smndt0(xx),smndt0(xy))!=sdtasdt0(xx,xy))). % 0.19/0.42 cnf(i_0_25, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_23, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_31, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(X1,smndt0(X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_30, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(smndt0(X1),X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_26, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_24, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_28, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_27, plain, (sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))=sdtasdt0(sdtpldt0(X1,X2),X3)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 cnf(i_0_29, plain, (sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))=sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 8 steps % 0.19/0.42 cnf(i_0_34, negated_conjecture, (sdtasdt0(smndt0(xx),smndt0(xy))!=sdtasdt0(xx,xy)), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (sdtasdt0(smndt0(xx),smndt0(xy))!=sdtasdt0(xx,xy)), inference(extension_rule, [i_0_7])). % 0.19/0.42 cnf(i_0_67, plain, (szszuzczcdt0(sdtasdt0(smndt0(xx),smndt0(xy)))!=szszuzczcdt0(sdtasdt0(xx,xy))), inference(extension_rule, [i_0_7])). % 0.19/0.42 cnf(i_0_68, plain, (~aNaturalNumber0(sdtasdt0(xx,xy))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.19/0.42 cnf(i_0_69, plain, (~aNaturalNumber0(sdtasdt0(smndt0(xx),smndt0(xy)))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.42 cnf(i_0_142, plain, (szszuzczcdt0(szszuzczcdt0(sdtasdt0(smndt0(xx),smndt0(xy))))!=szszuzczcdt0(szszuzczcdt0(sdtasdt0(xx,xy)))), inference(etableau_closure_rule, [i_0_142, ...])). % 0.19/0.42 cnf(i_0_143, plain, (~aNaturalNumber0(szszuzczcdt0(sdtasdt0(xx,xy)))), inference(etableau_closure_rule, [i_0_143, ...])). % 0.19/0.42 cnf(i_0_144, plain, (~aNaturalNumber0(szszuzczcdt0(sdtasdt0(smndt0(xx),smndt0(xy))))), inference(etableau_closure_rule, [i_0_144, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.19/0.42 # We now have 1 tableaux to operate on % 0.19/0.42 # Found closed tableau during pool population. % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------